News for hackers. Stuff that matters.

A comment on Markets are efficient if and only if P=NP (2010). Parent comment

Re:Markets are efficient if and only if P=NP (2010) by est31 on Wednesday October 21, 2020 @11:58AM (#24849064)
Yeah I doubt that nature is able to solve problems above a certain size. After you put together a certain number of soap bubbles they'll collapse into a black hole. Furthermore there are concerns of speed of light or speed of sound.

Nature might give efficient solvers for specific problems up to a certain size, but we already have "practical" NP problem solvers in classical silicon in the form of SMT solvers.

[ Parent | on HN ]
Re:Markets are efficient if and only if P=NP (2010) by MaxBarraclough on Wednesday October 21, 2020 @04:17PM (#24851630)
> we already have "practical" NP problem solvers in classical silicon in the form of SMT solvers.

They're out there, and practical for some problems, but SMT solvers aren't exactly a solved problem. They're used for deductive proofs about program correctness, which are still pretty finicky. [0]

[0] https://blog.adacore.com/using-spark-to-prove-255-bit-intege...

[ Parent | on HN ]