What Makes a Podcast/More About Pluto

In Podcast by Brian Koberlein1 Comment

Today we’ll go a bit meta, and talk about what exactly is a podcast, specifically One Universe at at Time. What’s our purpose, why did we start this in the first place, and where do we think it’s going? Our guest today is Mark Gillespie, the producer of the show.  In the second half of our show, Mark and I will talk about Pluto, and why it’s everyone’s favorite planet.

Host: Brian Koberlein
Guest: Mark Gillespie
Producer: Mark Gillespie
Music: Marcus Warner

The One Universe at a Time Podcast is produced at the Rochester Institute of Technology with support from the RIT College of Science.

Comments

  1. I’m glad you’ve kept up the podcast! It’s certainly been interesting hearing from experts in different fields, and it sounds like you have fun with it. As you discussed in this episode, it’s been quite surprising to me how insulated some of the scientists have been in their exposure to science.

    Perhaps more difficult, though, is that it was clear once or twice that for some guests, it may be their first venture into speaking publicly about their field, and so they may not know how to breach communicating on it. As someone who’s thought quite a bit about communicating about quantum computing, I found that episode quite difficult to listen to.

    I kept wanting to help the guest avoid saying things in ways that mislead or confuse people, as most general-audience articles about quantum computing tend to, but the conversation kept digging farther. It pretty much went through leading listeners to most of the common misconceptions about quantum computing. Some of the things stated were things that have just been passed through a broken telephone between different types of computing researchers until they’re no longer true. For example, RSA, the encryption algorithm susceptible to quantum computers factoring integers is no longer commonly used, and AES, among others, is not susceptible to quantum computer attacks unless quantum computers can solve NP-hard problems efficiently, which is widely believed to not be the case. Even if one could break modern encryption with future quantum computers, it’s not like that would be an application that’s very beneficial to society as a whole. Sorry, I’ll stop myself before this becomes a play-by-play of that episode.

Leave a Reply