Proof of Church's Thesis
arXiv:1209.5036 · doi:10.6084/m9.figshare.4955501.v4
Abstract
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.
arXiv comment7 pages, 2 figures