[ozb]

Almost every statement in this paper is wrong.

The central claim in particular is not proven because a physical theory P need not be able to express statements like "there exists a number G, which, when interpreted as the text of a theory T, essentially states that the theory T itself is unprovable in the broader physical theory P" as an empirical physical fact.

[NoahZuniga]

It's also very hard to verify the sources for some claims: I would expect the snag to be that many model theory results we have (Such as Gödel theorems) require quantifying over an infinite set, but that seems plausibly not possible to model in the physical universe. I quickly found this quote from the paper:

> Arithmetic expressiveness; LQG can internally model the natural numbers with their basic operations. This is important as quantum gravity should reproduce calculations used for amplitudes, curvature scalars, entropy, etc in appropriate limits. Both string theory [34, 37] and LQG [35, 38] satisfy this by reproducing GR and QM in appropriate limits

Here the citations are four entire books. How am I supposed to very that LQG can model N with that?

[roywiggins]

Here's a dumber argument: suppose you simulate a Newtonian universe in a computer. We do this at a coarse scale all the time. Now, suppose we dedicate a few percentage of solar output to this project and out pops functioning artificial life that can think more or less like we do. Such an "organism" would be able to discover Gödel incompleteness just as well, and thus eventually conclude via the same chain of logic as this paper that the simulation hypothesis is false. While inside a simulation.

Sure, I'm assuming here that nothing Gödel's brain did is fundamentally non-computable, but that's a pretty easy lift I think. Math is hard but it's not that hard.

[elfly]

This is not really necessary tho; it only requires that the mathematical model has a certain arithmetic complexity. The usual demo is Robinson Arithmetic, which is addition, multiplication on the natural numbers, and a successor operation.

Godel then latches onto that to create an alphabet of the symbols which then are mapped to numbers; thus formulas are even bigger numbers, and derivations are even bigger bigger numbers. So for any statements there should be a derivation that prove the statement is true or a derivation that proves the statement is false. Of course most statements will be false, but even then there will be a derivation showing so.

Then Godel does some clever manipulation to show that there will be some statements for which there can be no such derivation in either way. But that does not need the physics theory to express things about itself. It only requires to be mathematically complex enough (it'd be weird if a theory of everything was simpler than Robinson Arithmetic) and that it has rules of derivation of its statements (ie, that mechanical math can be applied to deduce the truth of the matter from the first principles of the theory).

Of course, the actual undecidable godel number and the associated physical proposition would be immensely complex. But that is only cause nobody has tried to improve on Godel's methodology of assigning numbers to propositions. He used what was simpler, prime factorization, cause it was easy to reason about, but results in astronomical numbers. But there is no reason a better, less explosive way of encoding propositions could be found that made an undecidible Godel number to be translated into something comprehensible.

But this is largely unnecessary; Godel proof forces the mathematical system to speak about itself and then abuses this reflection to create a contradiction. It means the system is not complete, that there are statements in the system that cannot be proven from its first principles and derivation rules; the fact that the one Godel showed to exist is self referential does not mean all the undecidable propositions _are_ self referential. There well could be other, non self referential undecidable propositions, that could very well have a comprehensible physical interpretation.

And, regardless of the universe being a simulation or not, the physical theory will ultimately need to deal with this incompleteness.

[ozb]

Godel's proof relies on the self-referential nature of the Godel sentence; without that, his theorem does not apply. Generally you need arithmetic, but also (something equivalently expressive to) universal quantification. Physical theories do not need to include that.

Note Godel's proof is mechanically exactly analogous to Turing's proof of the undecidability of the halting problem, because ultimately it's the same thing (Curry-Howard, Prolog, and all that). So you can bypass arithmetic, but you can't really bypass self-reference; just like programming languages need some looping or recursion (or equivalent expressiveness) to be Turing-complete, mathematical theories need universal quantification to be subject to Godel's Incompleteness Theorem.

Of course, you can have a physical theory that _is_ Turing-complete, say the Newtonian billiard ball model (and, y'know, we can build computers); but that doesn't mean the theory will necessarily tell you, as a static, measureable physical fact, whether a particular physical process (say, an n-body system) will ever halt or loop, or go on forever with ever-increasing complexity; so you could (in principle, in Newtonian mechanics) build some (mechanical!) physical system that simulates the Goldbach conjecture, or looks for solutions to an arbitrary Diophantine equation, but if there are no integer solutions you'll never actually be able to show it; the theory is incomplete in the mathematical sense, but just as complete a description of reality's rules.