AI & Computer Science · AI Books
Introduction to the Theory of Computation (Michael Sipser)
LISTEN TO THIS EPISODE
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.
Read about the original source: Introduction to the Theory of Computation
Part of Marginalia: books, papers, and ideas for learning and debate.