The Origins Podcast with Lawrence Krauss cover image

Scott Aaronson: From Quantum Computing to AI Safety

The Origins Podcast with Lawrence Krauss

CHAPTER

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.

00:00
Transcript
Play full episode

Remember Everything You Learn from Podcasts

Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.
App store bannerPlay store banner