Demaine. Games, Puzzles, and Computation
It shows that games and puzzles can serve as powerful models of computation, Offering a new way of thinking about computation.
- from
- Theoretical Computer Science
- added
- 2026-10-10
- likes
- 0
similar
-
Moore & Mertens. The Nature of Computation nature-of-computation.org
It spans complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and of quantum computing. It provides accessible explanations
-
Demaine, Abel & Chapman. Mathematics for Computer Science ocw.mit.edu
A junior introduction to discrete mathematics for computer scientists. - Companion Textbook 2015
-
Demaine. Algorithmic Lower Bounds: Fun with Hardness Proofs ocw.mit.edu
A class taking a practical approach to proving problems can't be solved efficient.
-
Apt & Grädel. Lectures in Game Theory for Computer Scientists cambridge.org
Games provide mathematical models for interaction, and numerous tasks in computer science can be formulated in game-theoretic terms.
-
Demaine/Ku/Soloman. Introduction to Algorithms. MIT ocw.mit.edu
A first course on basic algorithms and data structures. — added by Erik himself!
-
Demaine/Devadas/Lynch. Design and Analysis of algorithms. MIT ocw.mit.edu
A second course on algorithms and data structures. — added by Erik himself!
Theoretical Computer Science › Lower Bounds > Books: “It shows that games and puzzles can serve as powerful models of computation, Offering a new way of thinking about computation.”