Stories
Slash Boxes
Comments

SoylentNews is people

posted by jelizondo on Tuesday November 04, @07:36PM   Printer-friendly

Interesting Engineering published an article about a new mathematical study that dismantles the simulation hypothesis once and for all.

The idea that we might be living inside a vast computer simulation, much like in The Matrix, has fascinated philosophers and scientists for years. But a new study from researchers at the University of British Columbia's Okanagan campus has delivered a decisive blow to that theory.

According to Dr. Mir Faizal, Adjunct Professor at UBC Okanagan's Irving K. Barber Faculty of Science, and his international collaborators, the structure of reality itself makes simulation impossible.

Their work shows that no computer, no matter how advanced, could ever reproduce the fundamental workings of the universe.

Their research goes further than rejecting the simulation theory. It suggests that reality is built on a kind of understanding that cannot be reduced to computational rules or algorithms.

The researchers approached the simulation question through mathematics and physics rather than philosophy. They explored whether the laws governing the universe could, in theory, be recreated by a computer system.

"It has been suggested that the universe could be simulated," says Dr. Faizal. "If such a simulation were possible, the simulated universe could itself give rise to life, which in turn might create its own simulation.

This recursive possibility makes it seem highly unlikely that our universe is the original one, rather than a simulation nested within another simulation."

[Journal Reference]: https://jhap.du.ac.ir/article_488.html


Original Submission

 
This discussion was created by jelizondo (653) for logged-in users only, but now has been archived. No new comments can be posted.
Display Options Threshold/Breakthrough Mark All as Read Mark All as Unread
The Fine Print: The following comments are owned by whoever posted them. We are not responsible for them in any way.
  • (Score: 2, Interesting) by khallow on Wednesday November 05, @02:46AM (2 children)

    by khallow (3766) Subscriber Badge on Wednesday November 05, @02:46AM (#1423359) Journal

    but in order to simulate a system in a computer one must know all the rules that need to be simulated.

    One of the areas where the paper fails is in assuming one can't know all the rules. For glaring example, what's the physical characteristics of an uncomputable problem? They merely assuming such a problem can fit into the universe and as a result somehow that means non-algorithmic rules.

    Starting Score:    1  point
    Moderation   +1  
       Interesting=1, Total=1
    Extra 'Interesting' Modifier   0  

    Total Score:   2  
  • (Score: 2) by vux984 on Wednesday November 05, @05:49PM (1 child)

    by vux984 (5045) on Wednesday November 05, @05:49PM (#1423414)

    How did it "assume" that? The paper identified such problems, and addresses that issue quite directly.

    "For glaring example, what's the physical characteristics of an uncomputable problem?"

    One that is mathematically undecideable. (e.g. like the halting problem)

    " They merely assuming such a problem can fit into the universe "

    They argue that simulating the universe (in a computer) is equivalent to solving the halting problem which is not possible; and they argue a number of undecidable (non-computable) physics phenomena essentially embed the halting problem.

    • (Score: 1) by khallow on Thursday November 06, @01:38AM

      by khallow (3766) Subscriber Badge on Thursday November 06, @01:38AM (#1423445) Journal

      How did it "assume" that? The paper identified such problems, and addresses that issue quite directly.

      Let's review the basic argument. The undecidable argument is based on the following: that a sufficiently complex algorithmically generated system has undecidable problems, assume without justification that simulating the universe is somehow remotely related to deciding an undecidable problem, and thus can't be simulated by an algorithmic system again without justification. The very concepts and theorems described so far show how undecidable problems can easily fit within an algorithmic system. Classic case of stolen concept fallacy.