Welcome
Dive into the foundations of computer science through hands-on, interactive simulations. Each exploration lets you see abstract concepts in action — from theoretical computation to the physical logic gates inside every processor.
The Busy Beaver Problem
Explore Turing machines and computability theory. Watch a 2-state machine write the maximum number of 1s before halting, and learn why the Busy Beaver function is uncomputable.
Computability TheoryALU Binary Adder
See how computers add numbers at the gate level. Toggle binary inputs, select operations, and watch signals ripple through a chain of full adders built from XOR, AND, and OR gates.
Digital Logic