Conway's Game of Life in 2-dimensions, as my exemplar instance in the class of (what used to be my overly general answer of...) Automata: deterministic finite state machines and nondeterministic and probabilistic automata and the theory behind them leading to things like acceptors of regular languages and the concepts of simulation, computational equivalence and computability as in Turing machines and "Turing equivalent", and the concept of "power of computing", computational complexity and complexity classes, bisimulation (and the equivalent computing power of single-tape vs. multi-tape and other classes of Turing machines, and the equivalent computing power of systems which can simulate other systems).
|
2 | changed from a class of objects to a single instance | ||
|
|
||||
|
|
1 | [made Community Wiki] | ||
|
Automata: deterministic finite state machines and nondeterministic and probabilistic automata and the theory behind them leading to things like acceptors of regular languages and the concepts of simulation, computational equivalence and computability as in Turing machines and "Turing equivalent", and the concept of "power of computing", computational complexity and complexity classes, bisimulation (and the equivalent computing power of single-tape vs. multi-tape and other classes of Turing machines, and the equivalent computing power of systems which can simulate other systems). |
||||
