Closing the Circle: An Analysis of Emil Post's Early Work
From MaRDI portal
Publication:3430940
DOI10.2178/bsl/1146620062zbMath1120.03001OpenAlexW2038093353MaRDI QIDQ3430940
Publication date: 5 April 2007
Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/bsl/1146620062
History of mathematics in the 20th century (01A60) History of mathematical logic and foundations (03-03) Thue and Post systems, etc. (03D03)
Related Items (5)
On the complex behavior of simple tag systems -- an experimental approach ⋮ A personal account of Turing's imprint on the development of computer science ⋮ Conceptual Confluence in 1936: Post and Turing ⋮ Why Post Did [Not Have Turing’s Thesis] ⋮ Tag systems and Collatz-like functions
Cites Work
- Unnamed Item
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- On certain formal properties of grammars
- Why Gödel didn't have church's thesis
- Emil Post and His Anticipation of Gödel and Turing
- Recursive Unsolvability of a problem of Thue
- An Unsolvable Problem of Elementary Number Theory
- Finite combinatory processes—formulation
- Formal Reductions of the General Combinatorial Decision Problem
- Recursively enumerable sets of positive integers and their decision problems
- A variant of a recursively unsolvable problem
This page was built for publication: Closing the Circle: An Analysis of Emil Post's Early Work
