Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

P == NP proof

Name: Anonymous 2016-09-21 4:34

Sudoku solving is NP complete^[1]
Human brains can solve sudoku in polynomial time
There exists one example of polynomial time solving of a NP complete problem => P == NP.

^[1]http://www.cs.ox.ac.uk/people/paul.goldberg/FCS/sudoku.html

Name: Anonymous 2016-09-21 9:09

>>9
I'm not interested in theoretical aspects, just optimization problem. If given a fastest solver that solves X at N cpu cycles, N will be reduced substantially by optimization.
I'll benchmark it on a specific puzzle and post improvements here.

Newer Posts

P == NP proof

1 Name: Anonymous 2016-09-21 4:34

11 Name: Anonymous 2016-09-21 9:09

Name: Anonymous 2016-09-21 4:34

Name: Anonymous 2016-09-21 9:09