Skip to content
Introduction to the Theory of Computation (Michael Sipser) episode artwork

May 17, 2026 1 hr 14 min

Introduction to the Theory of Computation (Michael Sipser)

from Marginalia

Michael Sipser introduces the mathematical foundations of computation. Automata and formal languages explain what different computational models can recognize. Computability theory asks which problems can be solved by algorithms at all. Complexity theory studies how the required time and memory grow with a problem’s size. Proofs and examples connect these questions to the capabilities and limits of computers. Series: AI Books · Book deep dive Introduction to the Theory of Computation — Michael Sipser Publication source Explore: AI & Computer Science Related episodes: Structure and Interpretation of Computer Programs (Harold Abelson & Gerald Jay Sussman) · The Information: A History, a Theory, a Flood (James Gleick) Got something to say to this podcast? Send a voicemail, and you might hear yourself on the next episode!

Episode details come from the podcast's RSS feed.

Embed this episode

Ready to play

Introduction to the Theory of Computation (Michael Sipser)

0:00 1:14:54

No transcript yet.

Requests help us decide what to transcribe next.

Frequently asked questions

How long is this episode of Marginalia?

This episode is 1 hour and 14 minutes long.

When was this Marginalia episode published?

This episode was published on May 17, 2026.

Can I download this Marginalia episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.