Church Without Dogma: Axioms for Computability
From MaRDI portal
Publication:5384973
DOI10.1007/978-0-387-68546-5_7zbMath1148.68372OpenAlexW1588811107MaRDI QIDQ5384973
Publication date: 29 April 2008
Published in: New Computational Paradigms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-68546-5_7
Learning and adaptive systems in artificial intelligence (68T05) Cellular automata (computational aspects) (68Q80)
Related Items (12)
What Is an Algorithm? ⋮ What is the Church-Turing Thesis? ⋮ The decision problem for effective procedures ⋮ Unnamed Item ⋮ Parikh and Wittgenstein ⋮ Why Turing’s Thesis Is Not a Thesis ⋮ Transfinite recursion and computation in the iterative conception of set ⋮ Concrete digital computation: what does it take for a physical system to compute? ⋮ Is there any real substance to the claims for a ``new computationalism? ⋮ Gödel's reception of Turing's model of computability: the shift of perception in 1934 ⋮ The Church-Turing Thesis over Arbitrary Domains ⋮ A Natural Axiomatization of Computability and Proof of Church's Thesis
This page was built for publication: Church Without Dogma: Axioms for Computability
