Stephen Kleene
(2 articles)
1936
Universality
Concept that certain computational systems can simulate any other computational system, given the correct inputs and enough time and resources.
Generality: 941
1956
FSA
Finite State Automata
Finite State Automata
Computational model that processes input sequences and transitions between a finite number of states according to a set of rules, typically used for recognizing patterns or designing digital circuits.
Generality: 760