Axioms for Computability: Do They Allow a Proof of Church’s Thesis?
From MaRDI portal
Publication:4907915
DOI10.1142/9789814374309_0006zbMath1256.68062OpenAlexW2483080305MaRDI QIDQ4907915
Publication date: 26 February 2013
Published in: A Computable Universe (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/9789814374309_0006
History of mathematics in the 20th century (01A60) Biographies, obituaries, personalia, bibliographies (01A70) Cellular automata (computational aspects) (68Q80) General topics in artificial intelligence (68T01) History of computer science (68-03) General topics in the theory of computing (68Q01) Thue and Post systems, etc. (03D03)
Related Items (4)
What is the Church-Turing Thesis? ⋮ Conceptual Confluence in 1936: Post and Turing ⋮ Theses for Computation and Recursion on Concrete and Abstract Structures ⋮ Is there any real substance to the claims for a ``new computationalism?
This page was built for publication: Axioms for Computability: Do They Allow a Proof of Church’s Thesis?
