Title Statements
- Full title :Computability theory
Edition Statements
- Publication Date:2004
Publication Statements
- Publisher(s):Chapman & Hall
- Place of Publication:LONDON
- Language:eng
- Publication Date:2004
Notes
SECTION I: COMPUTABILITY, AND UNSOLVABLE PROBLEMS HILBERT AND THE ORIGINS OF COMPUTABILITY THEORY Algorithms and Algorithmic Content Hilbert's Programme G del, and the Discovery of Incomputability Computability and Unsolvability in the Real World MODELS OF COMPUTABILITY AND THE CHURCH-TURING THESIS The Recursive Functions Church's Thesis, and the Computability of Sets and Relations Unlimited Register Machines Turing's Machines Church, Turing, and the Equivalence of Models LANGUAGE, PROOF AND COMPUTABLE FUNCTIONS Peano Arithmetic and its Models What Functions Can We Describe in a Theory? CODING, SELF-REFERENCE AND THE UNIVERSAL TURING MACHINE Russell's Paradox G del Numberings A Universal Turing Machine The Fixed Point Theorem Computable Approximations ENUMERABILITY AND COMPUTABILITY Basic Notions The Normal Form Theorem Incomputable Sets and the Unsolvability of the Halting Problem for Turing Machines The Busy Beaver function THE SEARCH FOR NATURAL EX AMPLES OF INCOMPUTABLE SETS The
Written by a leading researcher, this is a concise, comprehensive and authoritative introduction to contemporary computability theory, techniques, and results and a guide to the direction of current research in the field.
The Physical Object
- Description:424
Edition Identifiers
- ISBN:1584882379, 9781584882374
- oclc:ocn473855823
- LC Classification:QA9.59
- Dewey Decimal:511.3
Rate & Review