Finiteness of the universe and computation beyond Turing computability
classification
🪐 quant-ph
keywords
computationturinguniversecomputabilityfinitenessbeyondchurch-turingclarify
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.