HackerPapers

arXiv:2505.11773gr-qc

Can quantum gravity be both consistent and complete?

Mir Faizal, Lawrence M. Krauss, Arshid Shabir, Francesco Marino, Behnam Pourhassan

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

Abstract

General relativity, despite its profound successes, fails as a complete theory due to presence of singularities. While it is widely believed that quantum gravity has the potential to be a complete theory, in which spacetime consistently emerges from quantum degrees of freedom through computational algorithms, we argue that this goal could be fundamentally unattainable. We examine how this limitation could emerge in various contexts, depending on whether or not every mathematically valid result is physically realized. In the first case, Godel's incompleteness theorems, along with related results by Tarski and Chaitin, imply that no theory formulated as a formal axiomatic system can be complete, and that within any computational framework, a fully consistent internal truth predicate is impossible. In the second case, if only a subset of mathematical truths is realized in nature, we argue that this selection cannot be determined by any purely computational process. Hence, a meta-theoretical approach based on non-algorithmic understanding is indispensable in every case. We discuss some possible consequences of this observation for describing physical systems and note that a non-algorithmic approach should be essential for any theory of everything.

arXiv comments
This paper received an Honorable Mention in the 2025 Gravity Research Foundation Essay Competition
Journal reference
International Journal of Modern Physics D 34, 2544017 (2025)
DOI
doi:10.1142/S0218271825440171
Subjects
gr-qcGeneral Relativity and Quantum Cosmology

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Jun 2025 to Jun 2025. Found in 1 HN submission from May 2025 to May 2025. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. BusyBeaver(6) Is Quite Large 1 comment
    • To try and help people digging into this, the following helped me. Two lenses for trying to understand this are potentially Chastain's limits on output of a lisp program being more complex than the program itself [1] or Markov's proof that you can't classify manifolds in d>= 4.…

      nyrikkiView on HNParent context

Submitted to Hacker News

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