Jürgen Schmidhuber (1997) has argued against this view; he asserts that Gödel's theorems are irrelevant for computable physics. In 2000, Schmidhuber explicitly constructed limit-computable, deterministic universes whose pseudo-randomness based on undecidable, Gödel-like halting problems is extremely hard to detect but does not prevent formal theories of everything describable by very few bits of information.
jürgen schmidhuber (1997) has argued against this view; he asserts that gödel's theorems are irrelevant for computable physics in 2000 schmidhuber explicitly constructed limit-computable deterministic universes whose pseudo-randomness based on undecidable gödel-like halting problems is extremely hard to detect but does not prevent formal theories of everything describable by very few bits of information