Finiteness of the universe and computation beyond Turing computability

Simple item page
dc.creatorKieu, Tien D.
dc.date2004-03-05
dc.date2004-03-16
dc.date.accessioned2026-07-07T06:09:14Z
dc.date.available2026-07-07T06:09:14Z
dc.descriptionWe 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.
dc.description2 pages. Extra notes added at the end of the paper on 16 April 2004
dc.identifierhttps://arxiv.org/abs/quant-ph/0403045
dc.identifierhttp://arxiv.org/abs/quant-ph/0403045
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91891
dc.subjectQuantum Physics
dc.titleFiniteness of the universe and computation beyond Turing computability
dc.typetext

Files

Collections

arXiv