Re:The Philosophy of Computational Complexity
by feynmanistheman on Tuesday May 29, 2018 @09:07PM
(#17184155)
Fascinating stuff. Wonder if one could decisively prove that the world matches one of Impagliazzo's possibilities if and when P != NP is proved. Question for another time, I guess, but important nonetheless.
[ Parent
| on HN ]
There are no comments on this comment yet.