About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 145. Chapters: Turing machine, Computation, Lambda calculus, Decision problem, Entscheidungsproblem, Kolmogorov complexity, Church-Turing thesis, -recursive function, Primitive recursive function, Oracle machine, Ackermann function, Computable number, Post correspondence problem, Busy beaver, Kleene's recursion theorem, Konig's lemma, Algorithm characterizations, Algorithm examples, History of the Church-Turing thesis, Halting problem, operator, Reverse mathematics, Godel numbering for sequences, Computability, Arithmetical hierarchy, Computable function, Turing degree, Von Neumann universal constructor, Recursive languages and sets, Hyperarithmetical theory, Fast-growing hierarchy, Reduction, Turing reduction, Effective dimension, Recursively enumerable set, McCarthy Formalism, Grzegorczyk hierarchy, Analytical hierarchy, Computability logic, List of undecidable problems, Kleene's T predicate, Post's theorem, Chain rule for Kolmogorov complexity, Computation in the limit, Description number, List of computability and complexity topics, Turing jump, ELEMENTARY, Bounded quantifier, Many-one reduction, Automatic semigroup, Slow-growing hierarchy, Buchi's Problem, PA degree, Course-of-values recursion, Forcing, Creative and productive sets, Recursive set, Automatic group, Primitive recursive functional, Arithmetical set, Smn theorem, Hardy hierarchy, Recursively inseparable sets, 01 class, Truth-table reduction, Maximal set, Alpha recursion theory, Craig's theorem, Richardson's theorem, Church-Turing-Deutsch principle, Effective method, Index set, Simple set, Martin measure, Myhill isomorphism theorem, Double recursion, Normal form, Recursive ordinal, Utm theorem, Complete numbering, Computable analysis, Tarski-Kuratowski algorithm, Effective Polish space, Trakhtenbrot's theorem, Computable isomorphism, Low basis theorem, High, ...
