%0 Journal Article
%T Proof of Church's Thesis
%A Ram¨Žn Casares
%J Computer Science
%D 2012
%I arXiv
%X We prove that if our calculating capability is limited to that of a universal Turing machine with a finite tape, then Church's thesis is true. This way we accomplish Post (1936) program.
%U http://arxiv.org/abs/1209.5036v4