Why Post Did [Not] Have Turing’s Thesis
From MaRDI portal
Publication:3305321
DOI10.1007/978-3-319-41842-1_7zbMath1439.03013OpenAlexW2583648154MaRDI QIDQ3305321
Dawn McLaughlin, Wilfried Sieg, Máté Szabó
Publication date: 6 August 2020
Published in: Outstanding Contributions to Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-41842-1_7
History of mathematics in the 20th century (01A60) Complexity of computation (including implicit computational complexity) (03D15) History of mathematical logic and foundations (03-03) Turing machines and related notions (03D10)
Cites Work
- On the complex behavior of simple tag systems -- an experimental approach
- The word problem in semi-groups with cancellation
- Closing the Circle: An Analysis of Emil Post's Early Work
- Why Gödel didn't have church's thesis
- Conceptual Confluence in 1936: Post and Turing
- Completeness and Categoricity, Part II: Twentieth-Century Metalogic to Twenty-first-Century Semantics
- Origins of Recursive Function Theory
- Generating, Solving and the Mathematics of Homo Sapiens: Emil Post’s Views on Computation
- Recursive Unsolvability of a problem of Thue
- The Ways of Hilbert's Axiomatics: Structural and Formal
- Transfinite recursive progressions of axiomatic theories
- On notation for ordinal numbers
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
- Formal Reductions of the General Combinatorial Decision Problem
- Recursively enumerable sets of positive integers and their decision problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Why Post Did [Not] Have Turing’s Thesis
