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.
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.