Why Turing’s Thesis Is Not a Thesis
From MaRDI portal
Publication:4637226
DOI10.1007/978-3-319-22156-4_12zbMath1384.03090OpenAlexW2414907226MaRDI QIDQ4637226
Publication date: 18 April 2018
Published in: Turing’s Revolution (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-22156-4_12
Related Items (max. 100)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Turing oracle machines, online computing, and three displacements in computability theory
- Reflections on Church's thesis
- General recursive functions of natural numbers
- \(\lambda\)-definability and recursiveness
- The upper semi-lattice of degrees of recursive unsolvability
- Formalism and intuition in computability
- Godel on computability
- A Natural Axiomatization of Computability and Proof of Church's Thesis
- The theory of recursive functions, approaching its centennial
- Step by Recursive Step: Church's Analysis of Effective Calculability
- Theses for Computation and Recursion on Concrete and Abstract Structures
- Semantics-to-Syntax Analyses of Algorithms
- Origins of Recursive Function Theory
- Church Without Dogma: Axioms for Computability
- Computability and Incomputability
- Computability and Recursion
- A note on the Entscheidungsproblem
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- Systems of Logic Based on Ordinals†
- Recursive Predicates and Quantifiers
- Formal Reductions of the General Combinatorial Decision Problem
- Recursively enumerable sets of positive integers and their decision problems
This page was built for publication: Why Turing’s Thesis Is Not a Thesis
