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!
Embed this episode
No transcript yet.