Based on the lectures for undergraduates at Moscow State University, this book presents a concise introduction to the central facts and basic notions of the general theory of computation.
In 1936, before the development of modern computers, Alan Turing proposed the concept of a machine that would embody the interaction of mind, machine, and logical instruction. The idea of a "universal machine" inspired the notion of programs stored in a c
Computable functions, decidable and enumerable sets; Universal functions and undecidability; Numberings and operations; Properties of Godel numberings; Fixed point theorem; m-reducibility and properties of enumerable sets; Oracle computations; Arithmetical hierarchy; Turing machines; Arithmeticity of computable functions; Recursive functions; Bibliography; Glossary; Index
Produkteigenschaften
- Artikelnummer: 9780821827321
- Medium: Buch
- ISBN: 978-0-8218-2732-1
- Verlag: American Mathematical Society
- Erscheinungstermin: 30.12.2002
- Sprache(n): Englisch
- Auflage: Erscheinungsjahr 2002
- Serie: Student Mathematical Library
- Produktform: Kartoniert
- Gewicht: 209 g
- Format (B x H x T): 139 x 217 x 17 mm
- Ausgabetyp: Kein, Unbekannt
