Intellectually Curious
Intellectually Curious is a podcast by Mike Breault featuring over 1,200 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 the basic trust that he could learn. It's shocking to find how many people do not believe they can learn, and how many more believe learning to be difficult. Muad'Dib knew that every experience carries its lesson.”
― Frank Herbert, Dune
Note: These podcasts were made with NotebookLM. AI can make mistakes. Please double-check any critical information.
- Update frequency
- every day
- Average duration
- 12 minutes
- Episodes
- 1399
- Years Active
- 2024 - 2025
OEIS A000152: Number of representations of n as a sum of 16 squares
We dive into A000152, the sequence counting how many ways an integer can be written as the sum of 16 squares. From the first terms (1, 32, 480, 4480, 29152) to the generating function built from the …
00:12:48 |
Thu 06 Mar 2025
The AI Benchmark: Do PhD-Level Tests Really Measure Intelligence?
In this episode we dissect a rigorous study that puts large language models through the GPQA Diamond Dataset—a suite of PhD‑level questions across physics, chemistry, and biology—to see how “smart” t…
00:10:41 |
Thu 06 Mar 2025
OEIS A000151: Oriented rooted trees
A deep dive into A000151, the enumeration of oriented rooted trees. We explore what distinguishes oriented rooted trees from ordinary trees, the two-color representation of edge directions, and the g…
00:12:36 |
Tue 04 Mar 2025
Reinforcement Learning from Human Feedback Guide
Learn about Reinforcement Learning from Human Feedback Guide
Note: These podcasts are AI-generated, and sometimes AI can make mistakes. Please double-check any critical information.
Sponsored by Ember…
00:26:45 |
Tue 04 Mar 2025
Google Engineering Practices
Learn about Google Engineering Practices
Note: These podcasts are AI-generated, and sometimes AI can make mistakes. Please double-check any critical information.
Sponsored by Embersilk LLC
00:29:14 |
Tue 04 Mar 2025
SpeciesNet: AI for Wildlife — Detect, Classify, and Conserve
This episode dives into SpeciesNet, Google's open-source AI toolkit for wildlife camera-trap images. Learn how a detector filters animals, a classifier labels species, how geofencing and taxonomic ro…
00:14:18 |
Tue 04 Mar 2025
Choosing the Right Manufacturing Strategy: MTS, MTO, and ATO
In this episode of Deep Dive, we break down the three core manufacturing strategies—Make to Stock (MTS), Make to Order (MTO), and Assemble to Order (ATO). We define each approach, examine their stren…
00:22:12 |
Tue 04 Mar 2025
The Deep Dive: Unraveling the Bullwhip Effect in Supply Chains
We dive into the bullwhip effect—how tiny shifts in consumer demand can snowball into big inventory swings up the chain. We unpack behavioral and operational causes, from misread signals to base-stoc…
00:22:52 |
Tue 04 Mar 2025
Demand Planning A Practitioners Guide to Supply Chain Excellence
Learn about Demand Planning A Practitioners Guide to Supply Chain Excellence
Note: These podcasts are AI-generated, and sometimes AI can make mistakes. Please double-check any critical information.
Sp…
00:30:16 |
Tue 04 Mar 2025
MECE Deep Dive: Mastering Mutually Exclusive, Collectively Exhaustive Thinking
In this episode we unpack the MECE principle—Mutually Exclusive, Collectively Exhaustive—and how it can sharpen your thinking and your decisions. We'll explore where MECE came from (Barbara Minto and…
00:10:31 |
Mon 03 Mar 2025
OEIS A000150: Rooted asymmetric polygon dissections
We examine A000150, the count of ways to dissect an n-gon into triangles with a distinguished exterior edge, counting dissections that are asymmetric about that edge. We trace its connections to Dick…
00:10:49 |
Mon 03 Mar 2025
Answer Set Programming Unplugged: Describing the Rules, Letting Solvers Find Solutions
A deep dive into ASP, where problems are described by rules rather than step-by-step instructions. We explore stable models, ANSProlog features (choice rules, cardinality bounds, variables, ranges, c…
00:22:50 |
Sun 02 Mar 2025
OEIS A000149: Floor of e^n
An exploration of OEIS A000149, the floor of e^n sequence: a(n) = floor(e^n) begins 1, 2, 7, 20, 54... We unpack how this simple definition connects to deep ideas—multiplicative growth (and why a(n)^…
00:08:20 |
Sun 02 Mar 2025
Finite Choice Logic Programming: Exploring All Solutions
A deep dive into finite choice logic programming—from its Horn-clause roots to the mechanics of fact-set semantics and saturation. We unpack open versus closed rules, functional dependencies, and fix…
00:17:38 |
Sun 02 Mar 2025
Karpathy How I use LLMs Feb 2025
Learn about Karpathy How I use LLMs Feb 2025
Note: These podcasts are AI-generated, and sometimes AI can make mistakes. Please double-check any critical information.
Sponsored by Embersilk LLC
02:11:11 |
Sat 01 Mar 2025
OEIS A000148: Partitions into Non-Integral Powers
We dive into OEIS A000148, exploring partitions into non-integral powers of integers. We break down what non-integral powers mean, using examples like inequalities involving fractional exponents (for…
00:11:46 |
Sat 01 Mar 2025
Geochemistry Unplugged: Oceanic Trace Metals
We unpack how trace metals in the oceans are governed by complex formation and oxygen availability, influencing what phytoplankton and microbes can actually use. From conservative metals that linger …
00:11:55 |
Sat 01 Mar 2025
Protein Engineering 101: Designing the Tiny Machines
A friendly dive into how scientists reshape proteins—nature’s workhorses—using rational design and directed evolution. We break down structure–function, the tools that reveal 3D shapes (X-ray crystal…
00:21:55 |
Sat 01 Mar 2025
OEIS A000147: Labeled trees of diameter 5
We zoom in on OEIS A000147, the number of labeled trees with diameter 5. A tree is connected and acyclic; diameter 5 means the farthest apart nodes are five edges apart, and such trees can be visuali…
00:08:19 |
Sat 01 Mar 2025
Zeckendorf's Theorem: The Unique Fibonacci Sum
Every positive integer has a unique representation as a sum of non-consecutive Fibonacci numbers, found by a simple greedy algorithm. In this episode we unpack the idea, the key lemma that guarantees…
00:10:23 |
Thu 27 Feb 2025
Disclaimer: The podcast and artwork embedded on this page are the property of Mike Breault. This content is not affiliated with or endorsed by eachpod.com.