Apr 30, 2026 · 25 min
Busy Beaver: Investigating Uncomputable Numbers
In this podcast, follow how the maximum number of symbols written by halting n-state Turing machines leads to values no algorithm can compute.
Collections containing this episode (7)
Original Tangente content, adapted into a podcast with the help of AI and validated by our editorial team. How does it work?
Listen next
Episodes that share a playlist, a figure or a field with this one.
Apr 14, 2025 · 25 min
Feb 14, 2026 · 22 min
Dec 1, 2025 · 22 min
Jun 24, 2026 · 6 min
Jun 19, 2026 · 5 min
Apr 30, 2026 · 5 min