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
- 1394
- Years Active
- 2024 - 2025
Deep Dive into Proof: Building Certainty in Abstract Mathematics
An accessible tour through the grammar of mathematical certainty. We move from propositions and logical connectives to universal quantifiers, exploring how proofs distinguish theorems from conjecture…
00:15:40 |
Fri 18 Apr 2025
OEIS A000196: Integer part of the square root
We dive into A000196, the floor of sqrt(n). From counting squares ≤ n to the recurring pattern that each value k appears 2k+1 times, this humble sequence links to divisor geometry, alternate bases ba…
00:11:25 |
Wed 16 Apr 2025
The Math Behind AWG: A Deep Dive into American Wire Gauge
In this episode of The Deep Dive, we unravel AWG—the geometric ladder that sizes electrical wire in North America. From its origins in wire-drawing to a standardized, logarithmic progression, we’ll c…
00:13:23 |
Wed 16 Apr 2025
Google Glass Development Uses Controversy
Learn about Google Glass Development Uses Controversy
Note: These podcasts are AI-generated, and sometimes AI can make mistakes. Please double-check any critical information.
Sponsored by Embersilk LL…
00:17:09 |
Wed 16 Apr 2025
Thad Starner
Learn about Thad Starner
Note: These podcasts are AI-generated, and sometimes AI can make mistakes. Please double-check any critical information.
Sponsored by Embersilk LLC
00:25:40 |
Wed 16 Apr 2025
Auditory Inspection: The Science Behind Parmigiano-Tapping
A Nobel laureate explains how a trained cheese master uses a precise tap to listen for internal structure, uniformity, and potential flaws in Parmigiano-Reggiano without cutting. We compare this arti…
00:08:24 |
Tue 15 Apr 2025
OEIS A000195: Floor of the natural logarithm
Join us as we explore OEIS A000195, the floor of the natural logarithm. We unpack how floor(ln n) climbs in a staircase at n = e^k, connect it to base-e “digits” and related sequences like A004233 an…
00:09:55 |
Tue 15 Apr 2025
Deep Dive: Cracking Dolphin Talk with Dolphin Gemma
An inside look at Google’s Dolphin Gemma AI and its team (Georgia Tech, the Wild Dolphin Project) decoding decades of labeled dolphin sounds from the Bahamas. We explore how the model learns patterns…
00:11:43 |
Tue 15 Apr 2025
OEIS A000194: Nearest integer to square root of n
We explore A000194, the sequence that maps n to the nearest integer to sqrt(n). We explain why 0 appears once and each k ≥ 1 appears 2k times, derive the rounding window k−1/2 < sqrt(n) < k+1/2, and …
00:10:45 |
Mon 14 Apr 2025
OEIS A000193: Nearest integer to log n
In this episode we zoom in on OEIS A000193—the nearest integer to the natural logarithm of n. Watch how the slow growth of ln(n) creates long plateaus and occasional jumps as n increases, and see how…
00:03:56 |
Sun 13 Apr 2025
Thermal Colloids: Gold Nanoparticles, Graphene, and Nanoscale Logic
Science Corner dives into how heat controls the behavior of gold nanoparticles in colloids and how carbon substrates like graphene and carbon nanotubes alter melting points through subtle atomic inte…
00:20:41 |
Sun 13 Apr 2025
Geometry in the Crow Brain: What Crows Reveal About Animal Math
New research shows crows can recognize geometric regularity, not just memorize pictures. In this episode of Science Corner, we break down the touchscreen experiments, explore how abstract geometry mi…
00:10:13 |
Sun 13 Apr 2025
GPT-4.5 Orion: Training the Giant — A Deep Dive into Scale, Data, and Safety
A deep dive into OpenAI's GPT-4.5 Orion: the two-year build, Azure-backed infrastructure, and the shift from compute-bound to data-bound bottlenecks. We dissect the full training pipeline—unsupervise…
00:15:58 |
Sat 12 Apr 2025
Naked Singularities and Cosmic Censorship
Learn about Naked Singularities and Cosmic Censorship
Note: These podcasts are AI-generated, and sometimes AI can make mistakes. Please double-check any critical information.
Sponsored by Embersilk LL…
00:23:24 |
Sat 12 Apr 2025
OEIS A000192: Generalized Euler Numbers
In this episode we zoom in on OEIS A000192, Generalized Euler Numbers, and ask what the word “generalized” really means here. We explore how Euler’s ideas—series, partitions, and combinatorics—get ex…
00:06:05 |
Sat 12 Apr 2025
OEIS A000190: Counts the number of solutions to x^4 ≡ 0 (mod n)
In this episode we explore the OEIS entry A000190, which assigns to every n the number of residues x modulo n for which x^4 ≡ 0 (mod n). The function is multiplicative, and for prime powers p^e it ha…
00:10:53 |
Sat 12 Apr 2025
OEIS A000191: Generalized tangent numbers
In this Deep Dive we explore OEIS A000191: the generalized tangent numbers. We walk through their definition via generating functions for two related families, t_n^(k) and s_n^(k), which generalize t…
00:11:20 |
Sat 12 Apr 2025
Ironwood Unveiled: The Physics of Google's Seventh-Gen AI Accelerator
A science-corner deep dive into Google's Ironwood TPU, the seventh-gen accelerator built for fast, power-efficient inference at massive scale. We’ll unpack the hardware breakthroughs—huge HBM memory,…
00:13:31 |
Thu 10 Apr 2025
OEIS A000189: Number of solutions to x^3 ≡ 0 mod n
In this episode we unpack A000189, the count of residues x modulo n whose cube is 0 mod n. We reveal the multiplicative structure: for n = ∏ p^{e_p}, a(n) = ∏ p^{⌊2e_p/3⌋}. We'll illustrate with smal…
00:17:28 |
Thu 10 Apr 2025
OEIS A000188: The Square Root of the Largest Square Dividing n
Three seemingly different definitions of A000188 converge on the same sequence: the square root of the largest square dividing n, the number of solutions to x^2 ≡ 0 mod n, and the maximum gcd(d, n/d)…
00:16:55 |
Tue 08 Apr 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.