I am also not a physicist nor a logician, just interested in the subject matter.
full of assertions not backed up by arguments
Can you provide some examples from the paper of assertions that aren't being backed up by arguments so I might try and look further into it? Thanks!
We don't understand gravity to the point where we have a consistent algorithmic explanation for it. As suggested, there are competing theories, all of which are algorithmically based. The holy grail of modern physics is to find the algorithm that explains gravity as that is the last missing piece to finalize the theory of everything.
The results of this research are implying that it is not possible to prove, algorithmically, that gravity is quantum but rather that quantum gravity as the foundation of the universe is non-algorithmic and therefore non-computational. And so a theory of everything is impossible, implying that the universe cannot be simulated by computing the theory of everything.
This research builds on a lot of the work that Roger Penrose did in the 90s in exploring the potential non-algorithmic nature of consciousness (https://en.wikipedia.org/wiki/Roger_Penrose#Consciousness). If you read his book "Shadows of the Mind" published in 1993 you will find a prediction of future computational abilities that is a shockingly accurate description of AI deep fakes and the AI slop we see today with LLMs.
The no-simulated universe idea is one interesting conclusion of this research, but in my opinion, a more interesting conclusion of this research is that if you believe Penrose's argument for consciousness being non-algorithmic, than this research is implying that AGI is also impossible.
Donate it to the library or a local food bank. Simple community building.
This statement is simply defining the fundamental structure of how a full theory of everything would be composed. A consistent and complete theory must meet all four criteria.
The above four criteria are how F_QG is defined. The author, in presenting these four criteria, provides two very specific, concrete examples of theories (String Theory and Loop Quantum Gravity) while introducing the premise of his argument. He clearly affirms that these theories do meet three of these four criteria but fail on the fourth. If there were an example of a theory that meets all four criteria than that theory would be the theory of everything and the whole issue would be resolved.
The rest of the paper explains exactly this. Mainly that the only way to satisfy all four criteria is to include non-algorithmic components that bridge the discreteness of math with the observable continuity of physics. The author goes on to describe several examples where this process can apply in modern physics theory.
I do agree that the author is making a dramatic and bold statement regarding a proof of a theory of everything (that being that the theory of everything can never be computational) which requires heavy scrutiny. However, I am in no way an expert in these fields and so I have accept that the journal that published the proof can provide that scrutiny. It is easy to check on the reliability of that journal as a lay person, and in doing so doesn't seem to raise any flags about the validity of the arguments the author is presenting.