The decision problem for effective procedures

DOI10.1007/s11787-023-00325-zOpenAlexW4366824209MaRDI QIDQ6113688

Nathan Salmon

Publication date: 11 July 2023

Published in: Logica Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11787-023-00325-z

zbMATH Keywords

algorithmChurch's thesisdecidabilitycomputabilityTuringdecision procedureChurch-Turing thesiseffective procedureeffectively calculable

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Word problems, etc. in computability and recursion theory (03D40) Applications of computability and recursion theory (03D80) Computable structure theory, computable model theory (03C57) Turing machines and related notions (03D10) General topics in the theory of computing (68Q01)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Second Thoughts about Church's Thesis and Mathematical Proofs
• A Natural Axiomatization of Computability and Proof of Church's Thesis
• Church's Thesis: Prelude to a Proof
• Church Without Dogma: Axioms for Computability
• An Unsolvable Problem of Elementary Number Theory
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: The decision problem for effective procedures