4 ms·
> How could a computer simulation perform exponential time operations efficiently? Assume P=NP. P currently not being NP is exactly the kind of thing someone
by craigsmansion 9y ago
> How could a computer simulation perform exponential time operations efficiently?
Assume P=NP.
P currently not being NP is exactly the kind of thing someone would build into a simulation to prevent stack overflows.
(I don't believe in simulation because: why would anyone that advanced bother?)
- mcguire 9y agoVery interesting idea! It's not immediately clear, however, that "P!=NP" is something that you could build into a simulation. (The demonstration that the lowest possible complexity of comparison-based sorting is O(n log n) comes to mind as a related example.)