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 our own galaxy and beyond, violent collisions fling a never-ending stream of stuff at the earth, and astrophysicists are eager to learn more about the processes that produce this cosmic barrage.
This past March, NIST Fellows Joseph Reader and Charles Clark co-authored an article in Physics Today: "1932, a watershed year in nuclear physics."
Phil Schewe discusses quantized energy levels with Steve Rolston (JQI) and Wes Campbell (former JQI postdoc and current UCLA professor).
Subscribe to A Quantum Bit
Quantum physics began with revolutionary discoveries in the early twentieth century and continues to be central in today’s physics research. Learn about quantum physics, bit by bit. From definitions to the latest research, this is your portal. Subscribe to receive regular emails from the quantum world. Previous Issues...
Sign Up Now
Sign up to receive A Quantum Bit in your email!