figshare
Browse
PoCT-fs4.pdf (61.86 kB)

Proof of Church's Thesis

Download (61.86 kB)
Version 4 2023-03-21, 07:52
Version 3 2022-04-27, 16:20
Version 2 2019-11-11, 08:55
Version 1 2017-04-30, 09:24
journal contribution
posted on 2023-03-21, 07:52 authored by Ramón CasaresRamó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

    Categories

    Keywords

    Church's thesisPost programTuring completenessPost's lawComputation Theory and Mathematics

    Licence

    CC BY 4.0

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC