Re:What if P = NP?
by bdhe on Friday April 01, 2011 @11:47AM
(#2396683)
That's an interesting read! I think his point is that NP-completeness does not give you an intuition about the hardness of automating creativity. That point is granted. However, if P were equal to NP, then it would imply that we can write algorithms that can automate creativity (Levin's algorithm is an algorithm to solve all NP-complete problems in polynomial time, if P=NP); which will raise an interesting philosophical debate all on its own.
[ Parent
| on HN ]
There are no comments on this comment yet.