Computationalism (the idea that everything in existence is fully characterized by states and transition functions) is
-
-
Replying to @Plinz
Not sure that states+transitions is a sufficient definition. It covers Turing completeness, but various oracle functions can extend it in qualitatively different ways, while still being of the flavor of computation. But computation as a concept being universal, yes.
2 replies 0 retweets 0 likes -
Replying to @ngutten
Could you please point me to a noncomputational oracle function?
1 reply 0 retweets 0 likes -
Replying to @Plinz
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.
1 reply 0 retweets 0 likes -
Replying to @ngutten
How would you know that it actually is a perfect halting oracle?
1 reply 0 retweets 0 likes -
Replying to @Plinz
I'm not sure you'd need to know that, but you'd find that to make accurate predictions of consistent events in the universe requires divergent computational effort on a Turing machine. You could probably probe it experimentally with asymmetric problems that are easy to confirm.
2 replies 0 retweets 0 likes
My point is that there is no way you could know that it solves the halting problem for an arbitrary algorithm running for unbounded time without looking at its mechanism. And if you can see its mechanism you already know that it doesn't.
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.