About this episode
We explore A000157, the count of Boolean functions of n variables (2^(2^n)), and show how these functions can be represented by algebraic normal forms over GF(2). We’ll see how the Mobius transform translates truth tables to polynomials, and discuss connections to cryptography, coding theory, and computational complexity, illustrated with simple examples like AND and XOR.
Note: This podcast was AI-generated, and sometimes AI can make mistakes. Please double-check any critical information.
Sponsored by Embersilk LLC
Get every episode summarized
Each time Intellectually Curious publishes, we email you a written briefing from the transcript — the topics, who appeared, and any specific claims, with the ad reads skipped.
Email me new episodesFree for 3 shows. No card needed.
Hosts & guests
No transcript yet
This episode has not been transcribed. Request it and it moves to the front of the queue.
More episodes
More from Intellectually Curious
Did OpenAI Solve Navier-Stokes? A Future-Shaping Claim Put to the Test
Intellectually Curious
Sep 9, 20265:52failed
Understanding the Hubble Tension
Intellectually Curious
Sep 9, 20265:57failed
OpenClaw 2.0 Feature Overview
Intellectually Curious
Sep 8, 20268:03failed
First to Leave, Last to Arrive: The $15 Million Fermi Explorer to Alpha Centauri
Intellectually Curious
Sep 7, 20265:50failed