Church's thesis and the conceptual analysis of computability

DOI10.1305/NDJFL/1179323267zbMath1139.03027OpenAlexW1963496350MaRDI QIDQ2472612

Michael Rescorla

Publication date: 22 February 2008

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1179323267

zbMATH Keywords

Church's thesisTuring machinecomputationthe results of computations on Turing machine with respect to the different representations of natural numbers by some strings of strokes on the tape of Turing machine

Mathematics Subject Classification ID

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

Related Items (7)

What is the Church-Turing Thesis? ⋮ The dependence of computability on numerical notations ⋮ Can Church's thesis be viewed as a Carnapian explication? ⋮ The Church-Turing Thesis over Arbitrary Domains ⋮ A Natural Axiomatization of Computability and Proof of Church's Thesis ⋮ The influence of domain interpretations on computational models ⋮ ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS

This page was built for publication: Church's thesis and the conceptual analysis of computability