Why Gödel didn't have church's thesis
From MaRDI portal
Publication:3669395
DOI10.1016/S0019-9958(82)91226-8zbMath0519.03033MaRDI QIDQ3669395
Publication date: 1982
Published in: Information and Control (Search for Journal in Brave)
History of mathematics in the 20th century (01A60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) History of mathematical logic and foundations (03-03) Recursive functions and relations, subrecursive hierarchies (03D20)
Related Items
What is the Church-Turing Thesis?, The problem of space invariance for sequential machines, ET and an infinitary Church's thesis, Formalism and intuition in computability, Computability-theoretic learning complexity, On the complex behavior of simple tag systems -- an experimental approach, Strict finitism and feasibility, American Logic in the 1920s, Can Church's thesis be viewed as a Carnapian explication?, Computability and Recursion, Step by Recursive Step: Church's Analysis of Effective Calculability, Diagonalisation and Church's Thesis: Kleene's Homework, Conceptual Confluence in 1936: Post and Turing, Proving Things About the Informal, My Life as a Logician, Why Post Did [Not Have Turing’s Thesis], Tag systems and Collatz-like functions, Alonzo church:his life, his work and some of his miracles, Gödel's reception of Turing's model of computability: the shift of perception in 1934, Radical anti-realism, Wittgenstein and the length of proofs, The Church-Turing Thesis over Arbitrary Domains, A Natural Axiomatization of Computability and Proof of Church's Thesis, Turing oracle machines, online computing, and three displacements in computability theory, Markov's constructive analysis; a participant's view, Closing the Circle: An Analysis of Emil Post's Early Work
