Turing Computability Theory and Applications /
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 computability theory from T...
| Main Author: | Soare, Robert I. (Author) |
|---|---|
| Corporate Author: | SpringerLink (Online service) |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2016.
|
| Series: | Theory and Applications of Computability, In cooperation with the association Computability in Europe,
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Similar Items
-
The Incomputable Journeys Beyond the Turing Barrier /
Published: (2017) -
Logical Foundations of Computer Science International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007. Proceedings /
Published: (2007) -
The Pillars of Computation Theory State, Encoding, Nondeterminism /
by: Rosenberg, Arnold L.
Published: (2010) -
Finitely Supported Mathematics An Introduction /
by: Alexandru, Andrei, et al.
Published: (2016) -
Mathematics of Discrete Structures for Computer Science
by: Pace, Gordon J.
Published: (2012)