Turing's famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. This model led to both the development of actual computers and to computability theory, the study of what machines can and cannot compute. This book presents classical computabili…
Computability theory
by Cooper, S. Barry, Cooper, S. Barry, CRC Press
fromChapman & Hall/CRC mathematics
Computability theory originated with the seminal work of Gödel, Church, Turing, Kleene and Post in the 1930s. This theory includes a wide spectrum of topics, such as the theory of reducibilities and their degree structures, computably enumerable sets and their automorphisms, and…
"Computability Theory presents a comprehensive, highly readable introduction to contemporary computability theory, techniques, and results. The author places the basic concepts and techniques in their historical, philosophical, and logical contexts, and offers an unusual breadth…
"Computability Theory presents a comprehensive, highly readable introduction to contemporary computability theory, techniques, and results. The author places the basic concepts and techniques in their historical, philosophical, and logical contexts, and offers an unusual breadth…
Das Buch richtet sich an Studierende der Informatik oder verwandter Studiengänge und enthält Übungsaufgaben mit Lösungen aus Gebieten, die typischerweise in den ersten Semestern als Grundlagen behandelt werden. Ausgenommen ist der Bereich des Programmierens. Das Buch ergänzt den…
This book represents the first treatment of computable analysis at the graduate level within the tradition of classical mathematical reasoning. Among the topics dealt with are: classical analysis, Hilbert and Banach spaces, bounded and unbounded linear operators, eigenvalues, ei…
