Gödel's reception of Turing's model of computability: the shift of perception in 1934
From MaRDI portal
Publication:2011634
Recommendations
Cites work
- scientific article; zbMATH DE number 6308207 (Why is no real title available?)
- A note on the Entscheidungsproblem
- Church Without Dogma: Axioms for Computability
- Godel on computability
- Hilbert's programs and beyond
- Recursive Predicates and Quantifiers
- Recursively enumerable sets of positive integers and their decision problems
- Step by Recursive Step: Church's Analysis of Effective Calculability
- The Richard Paradox
- The inconsistency of certain formal logics
- Why Gödel didn't have church's thesis
Cited in
(7)- The developments of the concept of machine computability from 1936 to the 1960s
- Conceptual Confluence in 1936: Post and Turing
- Formalism and intuition in computability
- Logical Approaches to Computational Barriers
- Logical Approaches to Computational Barriers
- The mathematician's bias -- and the return to embodied computation
- Godel on computability
This page was built for publication: Gödel's reception of Turing's model of computability: the shift of perception in 1934
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011634)