Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 122. Chapters: Turing completeness, Entscheidungsproblem, Recursion, Church-Turing thesis, Recursively enumerable language, -recursive function, Primitive recursive function, Rice's theorem, Chaitin's constant, Ackermann function, Self-reference, Wang tile, Computable number, Post correspondence problem, Mutual recursion, Busy beaver, Hypercomputation, Recurrence relation, Nomogram, Markov algorithm, Interactive computation, History of the Church-Turing thesis, Turing's proof, Halting problem, Digital physics, Computability, X-Machine Testing, Simply typed lambda calculus, Computable function, Super-recursive algorithm, Turing degree, Recursive languages and sets, Quantum Byzantine agreement, Semi-Thue system, Scale factor, Byzantine fault tolerance, Powerset construction, Stream X-Machine, Two Generals' Problem, Recursively enumerable set, Godel numbering, List of undecidable problems, Computation history, Nondeterministic algorithm, Brooks-Iyengar algorithm, Chain rule for Kolmogorov complexity, Computation in the limit, Description number, List of computability and complexity topics, Circuit, Algorithmic game theory, Undefined value, Computational semiotics, Omega language, List of unsolved problems in computer science, Recursive set, Limits to computation, First Draft of a Report on the EDVAC, Smn theorem, Real computation, Extended finite-state machine, Parallel computation thesis, Model of computation, Blockhead, Yao's test, Church-Turing-Deutsch principle, Two-way deterministic finite automaton, Ten15, Effective method, Sudan function, Bremermann's limit, Acceptable programming system, Rice-Shapiro theorem, History of theory of computation, Utm theorem, Cylindrification, Shadow square, Cylindric numbering, Tarski-Kuratowski algorithm, Range problem, Parallel terraced scan, Mortality, Communicating X-Machine, Computable is...