Episodes

  • The History of Neural Networks
    Nov 6 2026

    We talk about the history of artificial neural networks and attempt to explain some of their workings with the help of our friend Bob Farzin.

    Neurons: How the Brain Communicates | Mental Health America

    A LOGICAL CALCULUS OF THE IDEAS IMMANENT IN NERVOUS ACTIVITY*

    THE PERCEPTRON: A PROBABILISTIC MODEL FOR INFORMATION STORAGE AND ORGANIZATION IN THE BRAIN1 (Rosenblatt)

    The Rosenblatt Perceptron Algorithm

    Minsky-and-Papert-Perceptrons.pdf

    Learning representations by back-propagating errors

    Backpropagation Applied to Handwritten Zip Code Recognition - Y. LeCun

    ImageNet Classification with Deep Convolutional Neural Networks (aka Alexnet)

    [1706.03762] Attention Is All You Need (Transformers)




    Send us Fan Mail

    Show More Show Less
    1 hr and 20 mins
  • Are We All Going To Die?
    Oct 23 2026

    In this episode we explore the likelihood of existential risk from AI. We discuss the viewpoints of doomers and skeptics, and some of the scenarios that could lead to catastrophic outcomes. We admire the takes of the third most famous Michael Jordan. We conclude that not ALL of us will die, but maybe some of us.

    Michael I. Jordan on AI: “Superintelligence is science fiction”

    AI as Normal Technology

    Dario Amodei — We Must Pace the Frontier

    'A billion deaths': Bill Gates warns about AI in the wrong hands, saying a kill switch and self-regulation won’t be enough | Fortune

    Is the AI existential threat real—and can regulatory action prevent it? | Brookings

    Generative design of bacteriophages with genome language models | Science

    How Might Artificial Intelligence Affect the Risk of Nuclear War?

    Michael I. Jordan on AI: “Superintelligence is science fiction”

    AI ‘godfather’ Yann LeCun has ‘zero concerns’ about human extinction, says Anthropic CEO Dario Amodei is ‘deluded’ | Fortune

    AI 2027 - Rogue Replication Timeline — LessWrong


    Send us Fan Mail

    Show More Show Less
    1 hr and 10 mins
  • Thanks for the Memory Part 2: Garbage Collection
    Oct 9 2026

    This week we conclude our discussion of dynamic memory allocation with a discussion of the history and implementation of garbage collectors. There are no mentions of raccoons.

    Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I

    Uniprocessor Garbage Collection Techniques?

    cpython/InternalDocs/garbage_collector.md at main

    Generation Scavenging: A Non-disruptlve High Perfornm.nce Storage Reclamation Algorithm 1. Introduction 2. The Relationship Betw




    Send us Fan Mail

    Show More Show Less
    59 mins
  • Thanks for the Memory Part I: Allocators
    Sep 25 2026

    This week we present the first of two episodes on dynamic memory allocation. We were going to talk about garbage collection, but realized we should probably discuss allocators first. Turns out they are complicated, and there are many different strategies.


    Dynamic Storage Allocation: A Survey and Critical Review (Wilson)

    Hoard: a scalable memory allocator for multithreaded applications

    mimalloc: A new, high-performance, scalable memory allocator for the modern era - Microsoft Research

    A Scalable Concurrent malloc(3) Implementation for FreeBSD


    Send us Fan Mail

    Show More Show Less
    1 hr and 8 mins
  • From the Academy to Industry with Alan Dyke
    Sep 11 2026

    In this episode we interview Alan Dyke, a colleague of Erik's who got his Ph.D from the University of Wales, Aberystwyth, where he did research on Computer-Aided Software Engineering. We talk about Alan's unique journey in software development, going from the academic environment to the defense industry, embedded software, and biotech. We also learn about the crucial importance of calibrating your software for hurricanes.


    Send us Fan Mail

    Show More Show Less
    1 hr and 2 mins
  • The Monte Carlo Method
    Aug 14 2026

    In this episode we discuss the Monte Carlo method, both the technique and its place in the history of computing. The Monte Carlo method is a set of tools that use probability to solve problems that are otherwise intractable. Programs using Monte Carlo were among the first programs created on digital computers.


    The Monte Carlo Method Nicholas Metropolis; S. Ulam Journal of the American Statistical Association, Vol. 44, No. 247. (Sep.

    Equation of State Calculations by Fast Computing Machines

    Hitting the Jackpot: The Birth of the Monte Carlo Method | LANL

    Monte Carlo Sampling Methods Using Markov Chains and Their Applications W. K. Hastings Biometrika, Vol. 57, No. 1. (Apr., 1970),

    2014HaighPriestleyRope-LosAlamosBetsonENIAC.pdf

    The Unheralded Contributions of Klara Dan von Neumann




    Send us Fan Mail

    Show More Show Less
    56 mins
  • The Most Cited Papers from JACM
    Jul 24 2026

    In this episode we discuss the 5 most-cited papers from the flagship journal of the Association for Computing Machinery, the JACM. The papers include everything from distributed computing to real-time scheduling.

    Direct Search'' Solution of Numerical and Statistical Problems | Journal of the ACM

    Impossibility of distributed consensus with one faulty process | Journal of the ACM

    Robust principal component analysis? | Journal of the ACM

    Authoritative sources in a hyperlinked environment | Journal of the ACM

    Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment | Journal of the ACM


    What is HITS Algorithm (Hyperlink-Induced Topic Search)?


    Send us Fan Mail

    Show More Show Less
    1 hr and 14 mins