Computability and Incomputability

DOI10.1007/978-3-540-73001-9_75zbMath1150.03317OpenAlexW1515663676MaRDI QIDQ5425375

Robert I. Soare

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

zbMATH Keywords

computabilityKurt GödelAlan Turingcomputable approximationscomputability in analysisChurch-Turing Thesiseffectively continuous functions on realsstrong reducibilities reexaminedTuring \(a\)-machineTuring \(o\)-machine

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of mathematical logic and foundations (03-03) Turing machines and related notions (03D10)

Related Items (4)

Why Turing’s Thesis Is Not a Thesis ⋮ Mathematical and Technological Computability ⋮ Turing oracle machines, online computing, and three displacements in computability theory ⋮ On the power of recursive word-functions without concatenation

This page was built for publication: Computability and Incomputability