2004/03/05 by Tien D. Kieu, Kieu, Tien D. · 1 citation
Computer Science · Physics and Astronomy · #Cellular Automata and Applications #Computability, Logic, AI Algorithms #Quantum Computing Algorithms and Architecture #quant-ph
paper · pdf · doi:10.48550/arxiv.quant-ph/0403045
2 pages. Extra notes added at the end of the paper on 16 April 2004
arxiv created 2004/03/16 · arxiv updated 2009/12/01
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.