Proving Church's Thesis

DOI10.1093/PHILMAT/8.3.244zbMath0977.03003OpenAlexW1973773618MaRDI QIDQ2701936

Robert Black

Publication date: 9 January 2002

Published in: Philosophia Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/philmat/8.3.244

zbMATH Keywords

Church's thesisrecursive functioneffectively computable function

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Related Items (3)

What is the Church-Turing Thesis? ⋮ Proving Things About the Informal ⋮ A Natural Axiomatization of Computability and Proof of Church's Thesis

This page was built for publication: Proving Church's Thesis