Episode 58: Deutsch's "Creative Blocks": A Decade Later
The Theory of Anything
00:00
The Problem With Traveling Salesman Problems
Underneath NP is the class P, which is the tractable algorithms. You don't always know if a problem falls into you know it's NP, but you don't know if it's P or not. The field of AI is trying to figure out what do we do when we have an intractable problem and we still need to get a good answer. And there's tons of answers to that.
Transcript
Play full episode
