Dan Says - Simulated Universe is Impossible (Undecidable)

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
272 views
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Dec 8, 2010

Hello everybody!

The following is a video just discussing the impossibility of developing a computational model for computing a universe with perfect consistency with our own neverless of CPU, GPU or anything but, the nature of computing and the theorems abiding these laws. I could have easily taken the Godel's Incompleteness Theorem route but, I preferred to stick to strictly computational theorems in regards to universal problems. Keep in mind that scoped simulations are possible but, they must avoid every important concept to devise them. The largest issues relate to simulating the infinite (which is impossible to do on a finite machine with infinite precision for some instances). This concept is bunk. It's useful though to simulate things in the universe though but, some things cannot be correctly simulated based on simulation theory and computability theory in theoretical computer science.

  • likes, 2 dislikes

Link to this comment:

Share to:

Uploader Comments (Entertainmentwf)

  • Not everything in the universe would have to be computed, it might only compute what we see when we attempt to observe, so atoms, trees, moons, planets etc only exist when you look at them, in videogames if you turn quickly some objects blip in and out because in videogames things really do only exist when observed to save computation power.

    You only require the intelligent beings in the universe to believe it is real.

    Perhaps someone hacks it sometimes and gives us crop circles and pyramids.

  • @MDEMONIC689 The thing is those items will have a computational cost. The computational cost is not just time, but space. Thus it must be computed. Even if you stored those in a data structure or file. I don't quite follow how that is a counterargument seeing I'm discussing things not possible to be solved in theory of computation, and why our universe can't be. Undecidable problems are things that throw hoops for computation independently from machines.

  • This of course still ignores solipsism, solipsism in philosophy leaves a bad taste in the mouth, but in terms of simulated reality it means a lot if thinking about computational power since it only requires me to exist.

    I'm sure the computational power of 1 human brain is not far out of reach,but i hate solipsism as does anyone except the selfish.

    So question should be: what is the computational power of ALL living observers today? all the people and animals and insects, NOT the whole universe.

  • @MDEMONIC689 But the thing is there are many uncomputable things in our universe. Heck look at us. We can decide things no machine can ever do. This is why computation has undecidable theorems. Computation is a one to one correspondence with algorithms, and if the Church-Turing Thesis is infact true, it's definitely an impossibility.

    One can easily augment your problem to a computational geometry problem of plane clipping problem then apply the same reasoning again. Mortality Problem...

Video Responses

This video is a response to The Simulation Hypothesis
see all

All Comments (36)

Sign In or Sign Up now to post a comment!
  • If some things can be simulated, then all things can be simulated.

  • @MDEMONIC689 like I said... that has nothing to do with computability. Quantum computability doesn't contradict the foundations of computing. Even if that were true, that doesn't resolve computability. I am quite sure that isn't true since most quantum algorithms use finite processors. Quantum computation has it's own model of a Turing Machine called the Quantum Turing Machine. If we had one we could get linear time integer factorization but I will wait till it's actually constructed.

  • According to prof david deutsch a quantum computer would have infinite parallel processors because its working across the multiverse, that does not sound like a turing machine, he says turing devices collapse the wavefunction and thats the issue.

    I don't know if hes a lunatic or not because i don't understand the computational stuff but if he is correct then a quantum computer is actually working with other versions of itself, gives rise to infinite calculations per second.

  • @Entertainmentwf

    Im looking it from the philosophical and science angle.

    By science i mean specifically as a go between the copenhagen and many worlds interpretation of quantum mechanics I just find it interesting that it looks like it sits inbetween both, schrodingers cat is an interesting thought experiment and it did make me think about why there is such a strong observer effect, The delayed choice quantum eraser experiment is of particular interest.

  • @Lok783 ... I just explained that in this video...

  • How do you know this universe wont halt?

Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more