Finiteness of the universe and computation beyond Turing computability
量子物理
2007-05-23 v3
摘要
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.
引用
@article{arxiv.quant-ph/0403045,
title = {Finiteness of the universe and computation beyond Turing computability},
author = {Tien D. Kieu},
journal= {arXiv preprint arXiv:quant-ph/0403045},
year = {2007}
}
备注
2 pages. Extra notes added at the end of the paper on 16 April 2004