Computationalism (the idea that everything in existence is fully characterized by states and transition functions) is
-
-
So for example, a universe that has halting oracles can't be emulated in finite time/space on a Turing machine. It's still computation, just a superclass of what we can actually implement in our universe as far as we know.
-
How would you know that it actually is a perfect halting oracle?
- 5 more replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.