|
Computer Science 2012
Proof of Church's ThesisAbstract: 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.
|