4 ms·
There are no counterpoints because every turing complete simulation can't be made significantly more efficient. Any improvement would contradict the fact comple
by bronzeage 6y ago
There are no counterpoints because every turing complete simulation can't be made significantly more efficient. Any improvement would contradict the fact complexity classes classes strictly contain but aren't equal to each other. The most efficient way to run a universal turing machine on general input is to just run it.
- contravariant 6y agoTrue, but complexity doesn't necessarily have anything do to with time and space, that's all I really wanted to point out.
- skissane 6y agoI don't see how complexity classes are relevant here. If we accept that simulated time can run more slowly than real time – if it can take 10 seconds of computation time to simulate 1 second of simulation time – then complexity classes have no real relevance. Time complexity classes are just about how long a computation takes, and given an arbitrary amount of time to run the simulation in, and an arbitrary simulation rate (number of real seconds per a simulated second), it can take however long it takes. Even space complexity classes are not necessarily an issue. If the simulation runs out of storage, you can always suspend it, go provision more, and then resume it. The people in the simulation would never notice their suspension. It would only be a hard limit if some computation required more storage than could ever be provisioned, such as more bits than could fit in the observable universe. However, I doubt accurately simulating the contents of all contemporary human minds would need anywhere near that many bits.