What do the halting problem and P vs NP say about computing's limits?
The halting problem is proven unsolvable by any algorithm. P versus NP asks a different question, whether efficient finding is as easy as efficient checking, and it remains open.
Starter thread · AI-reviewed against its sources