News for hackers. Stuff that matters.
Re:Fifty or Sixty Years of Processor Development for This? by narrator on Wednesday April 04, 2018 @03:42AM (#16752815)
My argument against simulation is similar in thst certain algorithms for modeling physical processes can only run in exponential time. Protein folding is a good example. How could a computer simulation perform exponential time operations efficiently? It wouldn't work no matter how big a computer was made because the complexity would explode very quickly while reality can do it in real-time.
Re:Fifty or Sixty Years of Processor Development for This? by xaedes on Wednesday April 04, 2018 @04:15PM (#16758584)
There is no need for the simulated time to be equally "fast" (whatever THAT means) as fhe real one. it is annoying and impractical for us observing the simulation from the outside, but it wouldn't make any difference from the view of the simulation (under assumption of a closed system simulation)
Re:Fifty or Sixty Years of Processor Development for This? by mjburgess on Wednesday April 04, 2018 @04:22AM (#16752982)
That's another good way of illustrating the problem, however this is still just a symptom of the underlying problem. Models do not have the causal structure of the thing they model.

The reason the model would require near infinite time to run is that its modelling a causal event, it isnt an instance of the same causal event.

When electrical fields oscillate they model a bridge. No amount of activity would ever make them "solid".

All "real" stuff is infinite. This form of infinity is really about saying that our descriptions cannot capture the "full depth" of the world. The world itself has no "depth". Models, rather, are simply partial descriptions of it.

To turn a model into the thing its modelling via increasing its descriptive power quickly introduces infinities: its impossible. To make a model "accurate" in this sense, you must actually just make another example of the target. Ie., build that bridge.

Re:Fifty or Sixty Years of Processor Development for This? by craigsmansion on Wednesday April 04, 2018 @04:06AM (#16752926)
> 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?)

Re:Fifty or Sixty Years of Processor Development for This? by mcguire on Wednesday April 04, 2018 @02:18PM (#16757414)
Very 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.)

Re:Fifty or Sixty Years of Processor Development for This? by adrianN on Wednesday April 04, 2018 @04:23AM (#16752991)
Quantum computers can solve protein folding efficiently.
Re:Fifty or Sixty Years of Processor Development for This? by ziotom78 on Wednesday April 04, 2018 @06:51AM (#16753558)
"Can" or "could in principle"?
Re:Fifty or Sixty Years of Processor Development for This? by adrianN on Wednesday April 04, 2018 @07:47AM (#16753814)
"Can" as in quantum chemistry is one of the best applications for quantum computers.
Re:Fifty or Sixty Years of Processor Development for This? by ziotom78 on Wednesday April 04, 2018 @10:36AM (#16755086)
Sorry for the naivety, I am not an expert of quantum computing, therefore I asked. I am quite interested in the topic, might you give me some references, please?
Re:Fifty or Sixty Years of Processor Development for This? by adrianN on Wednesday April 04, 2018 @10:46AM (#16755193)