Go to main content
Formats
Format
BibTeX
MARCXML
TextMARC
MARC
DublinCore
EndNote
NLM
RefWorks
RIS
Cite
Citation

Linked e-resources

Details

Part I, The Roots of Computability Theory
Introduction
The Foundational Crisis of Mathematics
Formalism
Hilbert's Attempt at Recovery
Part II, Classicial Computability Theory
The Quest for a Formalization
The Turing Machine
The First Basic Results
Incomputable Problems
Methods of Proving Incomputability
Part III, Relative Computability
Computation with External Help
Degrees of Unsolvability
The Turing Hierarchy of Unsolvability
The Class D of Degrees of Unsolvability
C.E. Degrees and the Priority Method
The Arithmetical Hierarchy
Part IV, Back to the Roots
Computability (Church-Turing) Thesis Revisited
Further Reading
App. A, Mathematical Background
App. B, Notation Index
Glossary
References
Index.

Browse Subjects

Show more subjects...

Statistics

from
to
Export