Finiteness of the universe and computation beyond Turing computability
arXiv:quant-ph/0403045
Abstract
We clarify the confusion, misunderstanding and misconception that the physical finiteness of the universe, if the universe is indeed finite, would rule out all hypercomputation, the kind of computation that exceeds the Turing computability, while maintaining and defending the validity of Turing computation and the Church-Turing thesis.
2 pages. Extra notes added at the end of the paper on 16 April 2004