
ryanlpeterman@gmail.com
For verified host and producer emails, sign up to view.
Episodes: 58
Frequency: Weekly
Rating: 4.9/5.0
Estimated listeners: 1k-10k
Gender skew: Male
Location: USA
ryanlpeterman@gmail.com
For verified host and producer emails, sign up to view.
Ryan Peterman - Former Staff engineer at Instagram who shares transparent career stories from technical professionals.
Martin Hellman - Public-key Cryptography, The Crypto Wars, Encryption History, Information Security, And Career Advice.
Ryan Williams - Computational Complexity, Algorithms, Leetcode, SAT Problems, P Versus NP, Research Direction, And Solving Difficult Problems.
Charlie Marsh - Software Engineering, Rust And Python Tooling, Artificial Intelligence-generated Code, Open Source, Developer Tools, And Founding A Technology Company.
Turing Award Winner: TPU vs GPU vs CPU, Computer Architecture, RISC vs CISC | David Patterson
July 13, 2026
David Patterson is a Turing Award winner famous for his contributions to computer architecture. I interviewed him about his past work, thoughts on GPU/TPUs and career advice from half a century of experience.• My ergonomic keyboard project I mentioned, you can follow along here: https://read.compose.llc/• The Kickstarter page for it: https://www.kickstarter.com/projects/ryanlpeterman/compose-simple-ergonomics-beautifully-donePodcast links:• YouTube: https://youtu.be/Pn4ZwlEh5nw• Apple: https:...
Turing Award Winner: NSA, Public Key Cryptography, Crypto Wars | Martin Hellman
July 06, 2026
Martin Hellman is a Turing Award winner who helped to invent public-key cryptography against the NSA's wishes. I interviewed him all about his work and why it broke the law at the time.• My ergonomic keyboard project I mentioned, you can follow along here: https://read.compose.llc/• The Kickstarter page for it: https://www.kickstarter.com/projects/ryanlpeterman/compose-simple-ergonomics-beautifully-donePodcast links:• YouTube: https://youtu.be/AZLOETBCQM4• Apple: https://podcasts.apple.co...
MIT Complexity Theorist: Why You Can Do Better Than “Optimal” On Leetcode & SAT | Ryan Williams
June 29, 2026
Ryan Williams is a professor at MIT and the winner of the Gödel Prize in theoretical computer science. I interviewed him all about his work starting by asking him a popular Leetcode question (3 SUM).Correction: In this podcast I say "lower bound" when I mean "upper bound" and vice versa. Was speaking using the intuition that lower is better for running time. In reality, the accurate usage is:"Lower bound" = A proven floor for a problem e.g. "no algorithm can...
Try us risk free with a FREE 3 days trial.
Join hundreds of PR teams using Podseeker to pitch and land bookings