Church Without Dogma: Axioms for Computability

DOI10.1007/978-0-387-68546-5_7MaRDI QIDQ5384973zbMATH OpenOpenAlexFDO

Authors Wilfried Sieg

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

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Church's thesis and the conceptual analysis of computability
• A Natural Axiomatization of Computability and Proof of Church's Thesis
• Parametric Church's thesis: synthetic computability without choice
• Computationalism, the Church-Turing thesis, and the Church-Turing fallacy
• Axioms for computability: do they allow a proof of Church's thesis?
• Computability. Turing, Gödel, Church, and beyond
• Cleland on Church's thesis and the limits of computation
• Single axioms: With and without computers
• The Church-Turing Thesis over Arbitrary Domains
• The two forms of the Church-Turing thesis and the epistemology of computation

Cited in

(19)

• What is the concept of computation?
• 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
• Concrete digital computation: what does it take for a physical system to compute?
• What is an algorithm?
• Parikh and Wittgenstein
• A Natural Axiomatization of Computability and Proof of Church's Thesis
• scientific article; zbMATH DE number 1984273 (Why is no real title available?)
• Why Turing’s Thesis Is Not a Thesis
• scientific article; zbMATH DE number 1869994 (Why is no real title available?)
• scientific article; zbMATH DE number 922618 (Why is no real title available?)
• Axioms for computability: do they allow a proof of Church's thesis?
• scientific article; zbMATH DE number 1418434 (Why is no real title available?)
• Finiteness and computation in toposes
• What is the Church-Turing Thesis?
• Transfinite recursion and computation in the iterative conception of set
• The Church-Turing Thesis over Arbitrary Domains
• New Computational Paradigms
• The decision problem for effective procedures

This page was built for publication: Church Without Dogma: Axioms for Computability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384973)