autómata
91Theory of computation — In theoretical computer science, the theory of computation is the branch that deals with whether and how efficiently problems can be solved on a model of computation, using an algorithm. The field is divided into three major branches: automata… …
92Conway's Game of Life — Conway game , which redirects to here, can also refer to games as defined by surreal numbers, which John Conway also developed …
93Al-Jazari — Abū al Iz Ibn Ismā īl ibn al Razāz al Jazarī (1136 1206) ( ar. أَبُو اَلْعِزِ بْنُ إسْماعِيلِ بْنُ الرِّزاز الجزري) was an important Arab [citation|title=Archimedes Weapons of War and Leonardo|first=D. L.|last=Simms|journal=The British Journal… …
94Rule 184 — is a one dimensional binary cellular automaton rule, notable for solving the majority problem as well as for its ability to simultaneously describe several, seemingly quite different, particle systems:* Rule 184 can be used as a simple model for… …
95Pebble automaton — A pebble automaton is an extension of tree walking automata which allows the automaton to use a finite amount of pebbles , used for marking tree node. The result is a model stronger than ordinary tree walking automata, but still strictly weaker… …
96Transductor de estados finitos — Un transductor de estados finitos, o transductor finito, es un autómata finito (o máquina de estados finitos) con dos cintas, una de entrada y otra de salida. Esto contrasta con un autómata finito habitual, que tienes solamente una cinta. Podemos …
97Von Neumann universal constructor — John von Neumann s Universal Constructor is a self replicating machine in a cellular automata environment. It was designed in the 1940s, without the use of a computer. The fundamental details of the machine were published in von Neumann s book… …
98DFA minimization — In computer science, more specifically in the branch of automata theory, DFA minimization is the task of transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has minimum number of states. Here, two DFAs are called …
99Norman Margolus — Norman H. Margolus (born 1955)[1] is an Canadian American[2] physicist and computer scientist, known for his work on cellular automata and reversible computing.[3] He is a research affiliate with the Computer Science and Artificial Intelligence… …
100Máquina autoreplicante — Un forma simplificada de máquina autoreplicante Una máquina autoreplicante es una construcción artificial que es teóricamente capaz de fabricar, en forma autónoma, una copia de sí mismo usando materias primas tomadas del ambiente que la rodea. El …
