Re:The P=?NP Poll (2002) [pdf]
by averell on Monday November 07, 2016 @02:42PM
(#12894266)
Not a lot of mention of AI for CS, even in 2002. What about (2080+, P/=NP, proof techniques completely opaque to humans).
And by that I don't mean mechanical exclusion of special cases like for map-coloring. As mentioned already, there's like a handful of people that understand the FLT proof, that situation is unlikely to improve.
[ Parent
| on HN ]
There are no comments on this comment yet.