scientific article; zbMATH DE number 1984273

MaRDI QIDQ4428707zbMATH OpenFDO

Authors Wilfried Sieg

Publication date 22 September 2003

zbMATH Keywords

Church's thesiscomputations by machinesGandy machinesTuring's computor

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Recommendations

• Church Without Dogma: Axioms for Computability
• Axioms for computability: do they allow a proof of Church's thesis?
• scientific article; zbMATH DE number 1870428
• scientific article; zbMATH DE number 1869994
• Paper Machines

Cited in

(12)

• What is an algorithm?
• Foundational analyses of computation
• scientific article; zbMATH DE number 4072939 (Why is no real title available?)
• scientific article; zbMATH DE number 4108154 (Why is no real title available?)
• Conceptual Confluence in 1936: Post and Turing
• Theses for computation and recursion on concrete and abstract structures
• Proving Things About the Informal
• scientific article; zbMATH DE number 1869994 (Why is no real title available?)
• scientific article; zbMATH DE number 1870428 (Why is no real title available?)
• Paper Machines
• Axioms for computability: do they allow a proof of Church's thesis?
• The dependence of computability on numerical notations

This page was built for publication:

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