P Class Explained: The Problems Computers Can Solve Quickly

Scott Aaronson, theoretical computer scientist, professor at University of Texas Austin and leading innovator in quantum computing and complexity theory, talks about P problems and computational complexity theory. Full episode: https://youtu.be/0kt_4XbdiTU SUPPORT: Patreon: https://www.patreon.com/knowtime Anchor: https://anchor.fm/knowtime/support Youtube Membership: https://www.youtube.com/channel/UCJ-937lA3_s2g5AxdpKQjVg/join PODCAST: Anchor: https://anchor.fm/knowtime Spotify: https://open.spotify.com/show/2CjRJPktODLDeHavCNDLGA Apple Podcasts: https://podcasts.apple.com/us/podcast/know-time/id1535371851?uo=4 CONNECT: Youtube: Subscribe! Instagram: https://www.instagram.com/knowtimetofly/ Instagram (Personal): https://www.instagram.com/shalajlawania/ Twitter: https://twitter.com/knowtimetofly Twitter (Personal): https://twitter.com/shalajlawania Facebook: https://www.facebook.com/knowtimetofly Reddit: https://www.reddit.com/r/knowtimetofly/ Blog: http://www.sadisticshalpy.com/ Producer & Host: Shalaj Lawania #computerscience