HackerPapers

arXiv:quant-ph/0703041quant-ph

The Implications of a Cosmological Information Bound for Complexity, Quantum Information and the Nature of Physical Law

P. C. W. Davies

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

The finite age of the universe and the existence of cosmological horizons provides a strong argument that the observable universe represents a finite causal region with finite material and informational resources. A similar conclusion follows from the holographic principle. In this paper I address the question of whether the cosmological information bound has implications for fundamental physics. Orthodox physics is based on Platonism: the laws are treated as infinitely precise, perfect, immutable mathematical relationships that transcend the physical universe and remain totally unchanged by physical processes, however extreme. If instead the laws of physics are regarded as akin to computer software, with the physical universe as the corresponding hardware, then the finite computational capacity of the universe imposes a fundamental limit on the precision of the laws and the specifiability of physical states. That limit depends on the age of the universe. I examine how the imprecision of the laws impacts on the evolution of highly entangled states and on the problem of dark energy.

arXiv comments
Chapter for a book celebrating the work of Gregory Chaitin: "Randomness & Complexity, from Leibniz to Chaitin," edited by C.S. Calude, World Scientific, Singapore, 2007 (to appear)
Journal reference
DOI
Subjects
quant-phQuantum Physics

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Jun 2018 to Jun 2018.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Scott briefly discusses this issue in his book[1], where he cites a paper by Davies[2], which in turn cites one of Scott's talks[3]. I'm not sure about Davies' idea that the holographic bound should be formulated in terms of Kolmorgorov complexity instead of Shannon entropy, but…

      beefmanView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.