The paper is mostly in the "not even wrong territory" so it's hard to offer a concrete refutation, but their arguments apply equally to Conway's Game of Life, a Turing-Complete cellular automata for which Gödel undecidable questions may be asked yet which is easily simulated on a computer.
r/badmathematics have already looked at it.
"Being very generous, I think their attempt is to invoke this result of Chaitin to basically say "if the universe was a simulation, then there would be a formal system that described how the universe worked. By Chaitin, there's some 'complexity bound' for which statements beyond this bound are undecidable. But, these statements have physical meaning so we could theoretically construct the statement's analog in our universe, and then the simulation would have to be able to decide these undecidable statements."
What they don't explain is:
They also get into some more bad mathematics (maybe bad philosophy?) by appealing to Penrose-Lucas to claim that "human cognition surpasses formal computation," but I don't think this is anywhere near a universally accepted stance."