Mike Breault

Intellectually Curious

Science EN ↓ 2108 episodes

Intellectually Curious is a podcast by Mike Breault featuring over 1,800 AI-powered explorations across science, mathematics, philosophy, and personal growth. Each short-form episode is generated, refined, and published with the help of large language models—turning curiosity into an ongoing audio encyclopedia. Designed for anyone who loves learning, it offers quick dives into everything from combinatorics and cryptography to systems thinking and psychology. Inspiration for this podcast: "Muad'Dib learned rapidly because his first training was in how to learn. And the first lesson of all was t...

Be sure to visit the podcast's website and support the creator: intellectuallycurious.buzzsprout.com

Author

Mike Breault

Category

Science

Latest episode

Oct 21, 2026

Where to listen?

Podcasts in the app Replaio Radio Coming soon

Podcasts are coming to the app soon. Install now and be the first to see a whole new take on podcasts

Get it on Google Play Install for free Android almost 10M downloads · 4.8 rating iOS soon

Episodes

Deep Dive: The IRGC — From Revolutionary Militia to Power Broker 20.06.2025

We unpack the Islamic Revolutionary Guard Corps: its birth in 1979 as a revolutionary militia, its core ideological mission, five guiding principles, and its evolution into Iran's most powerful institution—military force, political engine, and economic powerhouse. Explore Khomeini and Khamenei’s roles, the martyrdom culture that fuels commitment, and what the IRGC means for Iran and the regio...

Detachment 201: Silicon Valley Meets the Army — The Executive Innovation Corps 20.06.2025

A deep-dive into the Army's new Executive Innovation Corps (Detachment 201), where top private-sector technologists join the Army Reserve as direct-commissioned officers to accelerate modernization. We unpack what the program is, who’s involved (Shams Sankar, Andrew Bosworth, Kevin Weil, Bob McGrew), how it’s structured, and how it fits into Army Transformation and AFC’s modernization push. W...

Software 1.0, 2.0, 3.0: The AI-Driven Rewrite of Software 20.06.2025

We unpack Andrey Karpathy's framework—from explicit code to neural nets to natural-language programs—and why the shift is redefining how we build, interact with, and deploy software. We'll explore the 'eating through the stack' phenomenon, the electricity-as-infrastructure analogy, and what it means for developers to fluently navigate 1.0, 2.0, and 3.0 in parallel. Note:   This...

OEIS A000254: Unsigned Stirling numbers of the first kind 19.06.2025

A000254 are the unsigned Stirling numbers of the first kind. In this episode we unpack two striking combinatorial interpretations that yield the same numbers: (1) the number of permutations of n+1 elements that decompose into exactly two disjoint cycles, and (2) the total number of cycles across all permutations of n elements. We’ll see how these viewpoints connect, with small-n examples, revealin...

From Timber to Arrow: The Craft of the Victorian English Longbow 18.06.2025

An inside look at the traditional English longbow, focusing on the Victorian form, from forest timber to finished arrow. Guided by a family of bowyers keeping the craft alive, the episode unpacks wood choices, self-bow vs laminates, roughing out, and the delicate art of tillering—revealing why patience and community have kept this ancient skill alive. Note:   This podcast was AI-generated, and som...

OEIS A000251: Diameter-6 Trees 18.06.2025

We count non-isomorphic trees with diameter exactly 6. Starting at seven vertices, the sequence shows how many distinct trees exist for n vertices, with terms that grow rapidly as you add vertices. The OEIS page reveals history (formerly M2887N1158, N1158) and the offset 7,2, plus how terms are generated via generating-function techniques like the shifted Euler transform and Piri code. It also con...

OEIS A000252: Number of invertible 2x2 matrices modulo n 18.06.2025

We dive into OEIS A000252, the sequence that counts the invertible 2x2 matrices over the ring Z/nZ (the order of GL2(Z/nZ)). The sequence is multiplicative and ties together several core ideas in algebra: the prime-power formulas, the compact general form a(n) = n^4 ∏_{p|n} (1 − 1/p)(1 − 1/p^2), and the connection to SL2(Z/nZ) since |GL2(Z/nZ)| = φ(n) · |SL2(Z/nZ)|. We also explore how a(n) counts...

OEIS A000253: Binary strings containing the pattern 010 18.06.2025

We explore A000253, which counts binary strings of length n+2 that contain the substring 010. With offset 0, the sequence starts 0, 1, 4, 11, 27, 63, ... and satisfies a_n = a_{n-1} + a_{n-2} + a_{n-3} + 2^{n-1} for n ≥ 3, with initial a0=0, a1=1, a2=4. The combinatorial heart is a Holger Petersen-style count: split strings into those that already contain 010 and those that first acquire it when e...

Inside the D-Layer: Cracking Earth’s Deep Mantle Mystery 18.06.2025

Journey 2,891 kilometers below the surface to the seismic D layer at the core–mantle boundary. We unravel how Murakami and team solved the long-standing puzzle of the DO region, combining seismic imaging with high-pressure lab experiments that reveal post-perovskite alignment under CMB conditions. Discover how the deep, textured landscape of the lowermost mantle shapes Earth’s magnetic field, mant...

Sprites, Jets, and Elves: The Secret Sky-High Light Show 18.06.2025

A deep dive into transient luminous events—the spectacular, fleeting electrical discharges that light up the upper atmosphere well above thunderstorms. From sprites and blue jets to gigantic jets and elves, we explore what TLEs are, how scientists finally observe them from the ground and from space, the physics that powers them, and why these otherworldly flashes matter for our understanding of th...

The Deep Dive: Autogyro — The Hidden Hybrid of Flight 18.06.2025

In this special Deep Dive from The Science Corner, we explore the autogyro (gyrocopter/gyroplane) — a rotorcraft that flies on autorotation with forward thrust. We unpack how it works, from rotor flapping and drag hinges to pre-rotators, and why it needs a takeoff roll. We'll trace Juan de la Cierva's breakthroughs, explore tractor vs. pusher layouts, and look at why autogyros haven’t re...

Unbundling Prestige: AI and the Quiet Reshaping of Law, Medicine, and Finance 16.06.2025

In this deep dive, we explore how AI is unbundling elite professions—taking over repeatable, data-heavy tasks in law, medicine, and finance. Through concrete stories, from a New York partner getting a 45-second AI synthesis to historical parallels of disruption, we examine what this shift means for prestige, employment, and the practical ways listeners can adapt today. Note:   This podcast was AI-...

Flip the Genome: The Hidden Power of Chromosomal Inversions 16.06.2025

Explore chromosomal inversions—the tiny flips of DNA that can ripple through health, fertility, and evolution. We’ll explain paracentric vs pericentric inversions, how they arise, what they mean for meiosis and offspring, and why most carriers are unaffected even as these flips shape pregnancy outcomes and development. Join us as we connect theory to real cases and current research, from common st...

Memoir: A Sparse Notebook for Lifelong Model Editing 16.06.2025

We dive into the challenge of updating large language models without erasing what they already know. The Memoir framework freezes the base model, adds a sparse residual memory, and uses a top-hash masking scheme to store and retrieve thousands of edits. Learn how edits are written to tiny memory slots, kept from colliding, and pulled at inference time, plus what experiments say about reliability,...

MILP Demystified: Turning Discrete Decisions into Global Optima 16.06.2025

A practical tour of mixed-integer programming (MILP): what it is, why discrete (yes/no) and continuous decisions matter in logistics, manufacturing, and services, and how solvers guarantee the best solution. We’ll dive into real-world applications—from facility location and scheduling to knapsack-style decisions and industrial symbiosis—and explain why exact optimization, despite being harder, del...

OEIS A000250: Number of Symmetric Reflexive Relations on N Nodes 16.06.2025

In this milestone Deep Dive, we tackle OEIS A000250: the count of symmetric reflexive relations on an N‑node set. We spell out what reflexive and symmetric mean in plain terms, why the naïve count 2^(N choose 2) isn’t correct, and how the actual enumeration uses deeper number‑theoretic tools—partitions of N and gcd‑type structure—along with the rich history and references in the OEIS entry. A clea...

Real-Time AI Video: The AAPT Breakthrough for Live, Interactive Worlds 14.06.2025

We dive into ByteDance Seed's AAPT—autoregressive adversarial post-training—that promises fast, frame-by-frame AI video for interactive experiences. Learn how a pre-trained diffusion model is converted into a causal, one-pass-per-frame generator, how KV caching and a sliding 5-second window keep latency in check, and why a three-stage training pipeline (diffusion adaptation, consistency disti...

Deep Dive: Primality in the Digital Age — From AKS to Elliptic Curves 14.06.2025

We explore how scientists test massive numbers for primality, why it's crucial for encryption, and how modern methods like elliptic curve primality proving produce compact certificates that let anyone verify giant primes without redoing the work. Note:   This podcast was AI-generated, and sometimes AI can make mistakes.  Please double-check any critical information. Sponsored by Embersilk LLC

OEIS A000249: Nearest integer to the modified Bessel function K_n(5) 14.06.2025

We peel back the math behind A000249, defined as the nearest integer to K_n(5), the modified Bessel function of the second kind. We introduce K_alpha(x), contrast it with the ordinary Bessel functions, and explain why K behaves exponentially for real x while diverging at zero. We cover integral representations, key asymptotics, and what they imply for the behavior as the order n grows with fixed x...

Idempotence Across Dimensions: From Discrete Grids to Banach Spaces 13.06.2025

A Fields Medalist guides us through how the simple rule P^2 = P resounds in two mathematical worlds. First, idempotent-compatible maps on grids reveal 3D compatibility, complementary maps, and a path to linearizing the discrete Burgers equation on lattice triangles. Then, in functional analysis, idempotent operators project onto subspaces of a Banach space, with the remarkable fact that bijections...

Cost of Delay: Unpacking the Hidden Price of Waiting in Tech and Defense 13.06.2025

A deep dive into the unseen price of waiting. We unpack cost of delay analysis—from practical metrics like CD3 and loss-month cost to the four COD curves (standard, urgent, fixed-date, intangible)—and show how delaying decisions or launches costs more than the budget. Drawing on private-sector lessons (Maersk, prioritization) and public-sector applications (Air Force, Kessel Run, TBMCS, Kratos), w...

Android 16 Baklava: The Deep Dive into Google's Bold New Android 12.06.2025

A guided tour of Android 16 Baklava (June 10, 2025): from the trunk-stable codename and privacy-first goals to Material U 4.0, refined navigation, 16KB memory pages, ART cautions, and on-device Linux virtualization. We translate the jargon and explain what it means for both users and developers. Note:   This podcast was AI-generated, and sometimes AI can make mistakes.  Please double-check any cri...

Across Time at Sea: The Chronicles of Famous Ships 12.06.2025

From the Bronze Age Uluburun to Archimedes’ Syracusia and Tudor Mary Rose, join us as we dive into the stories behind legendary ships. We’ll unpack cargoes, construction, and crews to reveal how vessels drove trade, warfare, and empire-building across centuries. Each episode links ancient networks to seafaring legends, uncovering the human ingenuity that sailed these time capsules. Note:   This po...

OEIS A000247: 2^n - n - 2 12.06.2025

In this Deep Dive we explore OEIS A000247, the sequence a(n) = 2^n − n − 2 for n ≥ 2, which starts 0, 3, 10, 25, 56, 119, 246, 501. We’ll unpack the meaning of the closed form, the offset, and how such a simple formula appears in a surprisingly wide range of problems: counting ways to split n+1 labeled balls into two indistinguishable boxes with at least two in each; permutation patterns that avoi...

OEIS A000246: Permutations with only odd-length cycles 11.06.2025

We explore A000246—the count of permutations of n elements whose cycle decomposition uses only odd-length cycles. Key ideas: every counted permutation is even (each odd-length cycle is an even permutation, and the product of evens is even); the remarkable equivalence with ballot permutations; the neat closed forms a(2m) = ((2m−1)!!)^2 and a(2m+1) = (2m+1)!!(2m−1)!!; and how these two very differen...

Listen to the Intellectually Curious podcast in Replaio

Radio and podcasts in one app - free, with no sign-up. Install today and do not miss the launch

Get it on Google Play

Replaio is not a podcast publisher; show names, artwork and audio belong to their authors and are distributed through public RSS feeds.