Computability and Incomputability
From MaRDI portal
Publication:5425375
DOI10.1007/978-3-540-73001-9_75zbMath1150.03317MaRDI QIDQ5425375
Publication date: 13 November 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73001-9_75
computability; Kurt Gödel; Alan Turing; computable approximations; computability in analysis; Church-Turing Thesis; effectively continuous functions on reals; strong reducibilities reexamined; Turing \(a\)-machine; Turing \(o\)-machine
01A60: History of mathematics in the 20th century
03-03: History of mathematical logic and foundations
03D10: Turing machines and related notions
Related Items
Why Turing’s Thesis Is Not a Thesis, Mathematical and Technological Computability, Turing oracle machines, online computing, and three displacements in computability theory