Scott Aaronson on Complexity, Computation, and Quantum Gravity
- Podcast Episode
- 2020
- 1h 52m
There are some problems for which it's very hard to find the answer, but very easy to check the answer if someone gives it to you. At least, we think there are such problems; whether or not ... Read allThere are some problems for which it's very hard to find the answer, but very easy to check the answer if someone gives it to you. At least, we think there are such problems; whether or not they really exist is the famous P vs NP problem, and actually proving it will win you a mi... Read allThere are some problems for which it's very hard to find the answer, but very easy to check the answer if someone gives it to you. At least, we think there are such problems; whether or not they really exist is the famous P vs NP problem, and actually proving it will win you a million dollars. This kind of question falls under the rubric of "computational complexity t... Read all