The limits of computation
Modern computers, which dwarf their forebears in speed and efficiency, still can't conquer some of the hardest computational problems. Making them even faster probably won't change that.
Computer scientists working in the field of computational complexity theory explore the ultimate limits of computers, cataloguing and classifying a universe of computational problems. For decades, they’ve been stuck on a particular nagging question, which boils down to this: What’s the relationship between solving a problem and checking your work?
This episode of Relatively Certain was produced and edited by Chris Cesare, with contributions from Emily Edwards, Sean Kelley and Kate Delossantos. It features music by Dave Depper, Podington Bear, Kevin MacLeod and Little Glass Men. Relatively Certain is a production of the Joint Quantum Institute, a research partnership between the University of Maryland and the National Institute of Standards and Technology, and you can find it on iTunes, Google Play or Soundcloud.
Recent Podcast Episodes
In many situations, chaos makes it nearly impossible to predict what will happen next. Nowhere is this more apparent than in weather forecasts, which are notorious for their unreliability.
Chaos. Time travel. Quantum entanglement. Each may play a role in figuring out whether black holes are the universe’s ultimate information scramblers.
What's it like living and working in Antarctica? Upon returning from a five-week trip to the Amundsen-Scott South Pole Station, UMD graduate student Liz Friedman sat down with Chris and Emily to chat about her experience.