Reversible computing is the study of computation that never destroys information — machines whose every step can be run backwards. It is where computer science meets thermodynamics: by Landauer's principle, erasing a bit has an unavoidable energy price, and forgetting nothing is the only road to computing with (in principle) no energy cost at all. The same ideas turn out to be the classical skeleton of quantum computing, the theory behind time-travel debuggers, and the checkpointing trick that trains today's largest neural networks.
This master's-level course builds the subject from thermodynamic first principles to the research
frontier: the physics of information, classical reversible gates and circuit synthesis, reversible
Turing machines and their space–time bargains, reversible cellular automata and the billiard-ball
computer, adiabatic circuits that recycle their own charge, programming languages that run equally
well backwards, the bridge to quantum circuits, and the ultimate physical limits of computation. It
assumes fluency with
The subject's story runs through a remarkable cast: