5
$\begingroup$

A few physicists (or computer scientists) take it for granted that the universe is a computation. However, I am not able to understand how the universe CAN be a computation in the first place.

I come from Classical Mechanics background, and I have not formally studied "Theory of Computation", so pardon me for the gaps in my knowledge. But from a basic understanding, I could not reconcile with the fact that the universe can be a computation.

I have 3 arguments against the hypothesis that the universe is a computation:

#1: Continuous vs Discrete

From what I understand from basic knowledge, most models of computation are discrete and finite. There are ideal models like the Turing machine which are discrete but infinite.

Is there a “continuous” infinite state machine? That is a machine that is both continuous and infinite.

The universe is (as far as we know) a continuous entity. However, if there can not exist a computational machine whose state is a continuum, then the universe can not be a computation.

#2 Computational Complexity

Another argument against the universe being a computation is this: Not all mathematical functions can be computed. However, the universe realizes all such functions seamlessly without halting. Hence, the universe probably isn’t computing at all.

#3 Newtonian vs Lagrangian Schema

Even another argument against the universe being a computation is this article: https://www.technologyreview.com/2012/12/04/84714/why-the-universe-is-not-a-computer-after-all/. In this essay, Prof. Wharton argues that while the Newtonian-type theories fit well with the computational model of the universe, the Lagrangian-type theories do not.

References

1 is a well-cited paper (600+ citations) by an MIT prof. It assumes that the universe is a computation and then proceeds to calculate its computational capacity. 2 is an award-winning essay by Prof. Wharton with 40+ citations that argues against the hypothesis that the universe is a computation. More references can be found on https://en.wikipedia.org/wiki/Digital_physics.

  1. Lloyd, Seth. 2002. “Computational Capacity of the Universe.” Physical Review Letters 88 (23): 237901. https://doi.org/10.1103/PhysRevLett.88.237901.
  2. Wharton, Ken. 2015. “The Universe Is Not a Computer.” ArXiv:1211.7081 [Gr-Qc, Physics:Physics, Physics:Quant-Ph], January. http://arxiv.org/abs/1211.7081.

Related Questions

Note that related questions have been asked before, but I could not find any question which poses this conundrum in its full form as posed here. E.g. this question raises the first argument I've raised above (Continuous-vs-Discrete), but it is trying to find some possible resolutions, whereas I am contesting the very fact that the universe is a computation. For me, it is completely clear that the universe is not a computation, then how are the physicists hypothesizing so? What am I missing?

$\endgroup$
14
  • 1
    $\begingroup$ Re, "...without halting..." In most of the problems that we solve by computing, we're looking for an end result when the computation is "finished," and most of our models of computing machinery have some notion of "halting" (or in some cases, "jamming," if the problem is unsolveable or the problem description is invalid.) But, that doesn't mean that every computation must have a definite end or, that every computing machine must have a well defined way of stopping. $\endgroup$ Commented Nov 20, 2020 at 17:09
  • 1
    $\begingroup$ FWIW, questions related to the Simulation Hypothesis tend to not be well-received on this site, but there are a few exceptions, eg physics.stackexchange.com/q/8895/123208 OTOH, I think your question may do ok, due to its critical stance. $\endgroup$
    – PM 2Ring
    Commented Nov 20, 2020 at 17:13
  • 1
    $\begingroup$ Re, "continuous vs. discrete." (A) People have built "computing machinery" that have continuous (a.k.a., "analog") states (see en.wikipedia.org/wiki/Analog_computer), and (B) the universe has many bits an pieces that can only occupy discrete states (e.g., anything that can be described with quantum theory.) $\endgroup$ Commented Nov 20, 2020 at 17:17
  • 1
    $\begingroup$ @shivams If you want to start a discussion on the closure of this question, the best location is the meta-page. $\endgroup$
    – Bernhard
    Commented Nov 20, 2020 at 19:58
  • 2
    $\begingroup$ A good question, but philosophical, would be: how would you know the computation is halted being a part of this computation. You cannot make the statement that the universe doesn't halt while you are in this universe. $\endgroup$
    – MsTais
    Commented Nov 20, 2020 at 20:58

2 Answers 2

2
$\begingroup$

There is a deep philosophical difference between the universe being a computation, and that the universe is computable. There is also an important issue of what model of computation one is assuming: most of the arguments in the question assume discrete Turing machines, but that is of course just one (perhaps obvious) choice.

1: can you make a continuum state machine? Of course! You just have a state transition function like $S_{n+1}=f_1(S_n,I_n)$ where the states $S_n$ and inputs $I_n$ are now members of a set like $R^n$. Don't like discrete steps? Sure, just make it $S'(t)=f_2(S(t),I(t))$. One can obviously embed any discrete state machine in the first equation, and by the right contrived choice of $f_2$ you can embed a discrete step machine $f_1$ in the second equation.

2: You are asserting that the universe realizes all mathematical functions. This is not obviously true and requires a powerful argument.

It is trivial to construct computable functions that cannot be realized in standard physics since there are not enough resources. For example, take the Ackermann function and nest it a bit for good measure: $f(n)=A(A(n+10,n+10))$. Mathematically this is well defined and computable, yet the number of steps to compute $f(1)$ and the amount of information involved vastly exceeds what we think are the bounds on distinguishable bits in the accessible universe and its causal future. If you want to claim it can be computed you need to show how we can get access to computational resources breaking the Bekenstein bound and/or persisting indefinitely far into the future with no error.

3: Physics is not obliged to follow any particular schema. That Lagrangian variational extremisation is hard to compute using our common computers do not mean no computers are good at it (indeed, as quantum computation shows, there exist models of computation that turns problems that are very hard in classical computation feasible), and there is of course no reason to think the universe has to be a perfect Lagrangian mechanics except that so far this model works well. Warton points out that for linking QM to GR you need to use Lagrangian mechanics, but this is based on our current, incomplete understanding of physics: GR, QM and quantum gravity could all work differently from expected and still fit our observations.

I think people underestimate both how weird physics could be and how weird computers could be. While few believe hypercomputation is an actual possibility, we cannot just rule it out a priori. Confidently claiming the universe cannot be computed needs to specify both the computational power of the universe and what computer we speak of. Since that computer doesn't even have to fit into the universe, it is a tall order.

$\endgroup$
0
$\begingroup$
  1. Our best model of the Universal microstructure is in fact a discrete one, and not continuous as you suggest. Everything is quantised, even space and time. Due to quantum uncertainty, distances below the Planck length and time periods shorter than the Planck time cannot occur. The continuous equations which we use to model larger-scale events break down at this smallest scale. Loop quantum gravity is constructed on this principle and is a strong competitor to string theories. It is also worth noting that discrete does not imply binary. Even an analogue computer is discrete in the sense that it resolves down to the nearest quantum of signal energy and no further.
  2. and 3. While not all functions can be computed exactly, they can be iterated indefinitely - which is what the Universe appears to be doing. Programming tricks are used to keep diverging functions within manageable limits. (tricks which my first pocket calculator intriguingly lacked). Phenomena such as the uncertainty principle and renormalisation could be examples of such computational tricks.

Posit a sufficiently powerful intelligence with vast resources in a higher-dimensional universe, and why should their unimaginably sophisticated computers not be able to simulate ours? (See at least one other answer)

And there, of course, lies the weakness of the whole naive edifice; despite all the above, your uneasiness is well founded. It is merely dressing up Bishop Berkeley's idealist God in SF technobabble. For "the mind of God" read "a super-alien super-computer". Why bother with the computer? Berkeley's God did not delegate the Creation to the Archangel Gabriel, He just got on with applying Occam's razor, as any good super-alien would do.

It is true that modern information theory is playing an increasingly fundamental role in thermodynamics and cosmology, to the point that at least one respected physicist has remarked that, "The Universe begins to look more like a great thought than a great machine". But to make that leap, and say that the Universe therefore equates to information, begs the question as to why the most complex structures in the Universe (our heads) are so full of illusions, mistakes, paradoxes, contradictions, fantasies and outright lies, yet none of that information manifests itself physically.

Just another example of Einstein's old saw that philosophers may make bad scientists, but scientists make even worse philosophers.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.