Skip to main content
Browse
Browse and Search
Search
Proof of Church's Thesis
Cite
Download
(61.86 kB)
Share
Embed
Version 4
Version 4 2023-03-21, 07:52
Version 4 2023-03-21, 07:52
Version 3 2022-04-27, 16:20
Version 3 2022-04-27, 16:20
Version 2 2019-11-11, 08:55
Version 2 2019-11-11, 08:55
Version 1 2017-04-30, 09:24
Version 1 2017-04-30, 09:24
journal contribution
posted on 2023-03-21, 07:52
authored by
Ramón Casares
Ramón Casares
We prove that if our calculating capability is that of a universal Turing machine with a finite tape, then Church's thesis is true. This way we accomplish Post (1936) program.
History
Usage metrics
0
0
0
Categories
Theory of computation not elsewhere classified
Keywords
Church's thesis
Post program
Turing completeness
Post's law
Computation Theory and Mathematics
Licence
CC BY 4.0
Exports
Select an option
RefWorks
RefWorks
BibTeX
BibTeX
Ref. manager
Ref. manager
Endnote
Endnote
DataCite
DataCite
NLM
NLM
DC
DC