Truth-Table Explorer
Generate the full truth table for AND, OR, XOR, NAND, and NOR gates with two or three inputs. Built for ECE 2700 (Digital Circuits).
Truth-Table ExplorerEvery demo below is self-contained — no frameworks, no build step, no tracking — so you can open the page source and see exactly how each computation works. The research-flavored ones run the same algorithms as the serious tools (Gillespie simulation, state enumeration, uniformization), just on networks small enough for a browser. The rest are classic probability toys. Pick one and poke it.
Generate the full truth table for AND, OR, XOR, NAND, and NOR gates with two or three inputs. Built for ECE 2700 (Digital Circuits).
Truth-Table ExplorerGillespie’s stochastic simulation algorithm running on textbook chemical reaction networks — immigration–death, SIR epidemics, predator–prey, and gene expression — with exact trajectories.
Chemical Reaction NetworksEnumerate every reachable state of a reaction network under a molecule cap and watch the state-space explosion grow — linearly, quadratically, then much worse.
State-Space ExplorerCompute the exact transient distribution P(X(t) = n) of an immigration–death chain by uniformization — the same core algorithm used by PRISM and Storm, and by Stamina’s reachability machinery.
Transient Probabilities by UniformizationExact probabilities of extinction by a deadline in a growing population — the rare-event reachability problem that motivated Ragtimer, and where a million simulated trajectories would still miss.
Rare-Event ReachabilityDrop balls through a pegboard and watch order emerge from coin flips: the binomial distribution walks toward a bell curve as samples pile up.
Galton BoardThe classic single-server queue, solved exactly: steady-state distribution, mean line length, and waiting times.
The M/M/1 QueueExact bankruptcy probabilities for the classic gambler’s ruin random walk — a CTMC with two absorbing states, and a small sibling of the rare-event computations Ragtimer does.
Gambler's Ruin