The Origins Podcast with Lawrence Krauss cover image

Scott Aaronson: From Quantum Computing to AI Safety

The Origins Podcast with Lawrence Krauss

00:00

Understanding Computability and Complexity

This chapter explores the concepts of computability and complexity, including the halting problem and the distinction between problems that allow for polynomial scaling and exponential scaling. It discusses the complexity classes P and NP, giving examples of efficiently solvable problems and problems that have efficient algorithms for checking answers. The chapter also delves into the implications of the P versus NP problem and the concept of NP complete problems.

Transcript
Play full episode

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app