The Universe Is Not a Computer
technologyreview.com
technologyreview.com
The following statements are not equivalent: 1) The universe is computational or digital in structure. 2) The universe is a giant computer. 3) The universe is a simulation.
#2 implies #1. #3 implies both #2 and #1. #1 does not imply #2 and #3. The universe can be digital in nature, without being either a simulation or a "giant computer".
Also I think it ironic that the article uses quantum mechanics to show how the universe cannot map to computational processes because of the problem of determinism, at the very time when quantum mechanics is being used to create computational devices that leverage the property of non-determinism.
Also "dangerously wrong"? Where's the danger, exactly? This whole article boils down to the question, "But what if they are wrong?" Ok, what if? What if Supersymmetry is wrong? What if String Theory is wrong? That's the way science works. You propose ideas. You test them. You throw out the bad/unprovable/wrong ones.
The point of the paper is that apparently the yout's of today are being taught that the universe started at the beginning of time with an initial state of S0, and then the state of the universe evolved (and continues to evolve) from that point point in time towards the future. There is one special point in time, which is now, and the past states of the universe no longer exist and the future state of the universe do not yet exist.
In GR, however, this is not the way things work. Instead, all states of the universe always exist, the past states are still there and the future states are already there, and the present is not a special point in time; it just happens to be where we are. The fact that we don't currently experience the past or the future is no different from the fact that we are also not in Idaho.
The universe, instead of evolving from the past to the future is the ever-exising solution to some equations. The distinction becomes more apparent when you think about the existence of closed timeline loops in GR and how those could exist without paradox. It's easy! Pardoxical situations are not a solution the equations.
Is this view right? Who can say? What's dangerous about only presenting the "computational" view is that it limits the imagination of what is possible. Both models should be presented so that young minds evolve in a more flexible manner.
So what you are saying is that the author is objecting to that view which limits one's understanding of the universe to a fixed-state system.
If you say "the universe is/isn't a computer", you're in the terrain of metaphysics again.
Terrible title for an interesting article.
For now, it's still booting. That the boot process takes so long is only due to our relative perspective.
But relativity killed the simple, clean model of Newtonian physics by kicking out the underlying assumptions, and I like the idea that at least somebody's considering the possibility that maybe our deepest, most fundamental premises are completely wrong.
I have no idea how anyone who's gone all the way through to a physics Ph.D. is going to be able to unlearn those assumptions though, that sounds incredibly difficult.
A lot of people conjecture that, if true, it implies that there exists no deterministic process which cannot be modeled by an algorithm.
The jury is still out on the proper interpretation of quantum mechanics, but quantum phenomena doesn't rule out the deterministic state-change metaphor a priori.
Maybe I have my computer science theory all wrong but I distinctly remember this statement: the universe is Turing complete.
That means that it is at least a computer - it may be something more - but it must be at the very least a computer.
Secondly WTF is with non-computable arguments. Given arbitrary memory and ability to do computation - anything can be computed.
Thirdly what's this mapping crap - the universe's probabilistic state does not need to be mapped - it's just information moving around.
The Lagrangian method he uses can be computed. Looks just like an expensive optimisation problem.
Also, not everything is computable. Alan Turing proved this in his paper "On Computable Numbers, with an Application to the Entscheidungsproblem." The Halting Problem is a related example of the limits of computation.
The halting problem can be effectively solved for deterministic finite machines - it would just take a long time time.