Fifty or Sixty Years of Processor Development for This?

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?)

[ Parent | on HN ]

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.)

[ Parent | on HN ]