Recursion Theory : Computational Aspects of Definability, Hardcover by Chong,...

Recursion Theory : Computational Aspects of Definability, Hardcover by Chong, Chi Tat; Yu, Liang, ISBN 3110275554, ISBN-13 9783110275551, Like New Used, Free shipping in the USChong and Yu introduce recursion theory focusing on the computational aspects of the set of reals and its subsets. They cover fundamental theory, the story of Turing degrees, hyper-arithmetic degrees and perfect set property, and higher randomness theory. Specific topics include hyperarithmetic theory, admissibility and constructability, recursion-theoretic forcing, set theory, the classification of jump operators, basic theorems, independence results in recursion theory, rigidity and bi-interpretability of hyper-degrees, and classical algorithmic randomness. Annotation ©2015 Ringgold, Inc., Portland, OR ()