autómata

  • 111Computability — You might be looking for Computable function, Computability theory, Computation, or Theory of computation. Computability is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within… …

    Wikipedia

  • 112Hugo de Garis — (born 1947, Sydney, Australia) is a researcher in the sub field of artificial intelligence (AI) known as evolvable hardware. He became known in the 1990s for his research on the use of genetic algorithms to evolve neural networks using three… …

    Wikipedia

  • 113Pushdown automaton — In automata theory, a pushdown automaton (PDA) is a finite automaton that can make use of a stack containing data. Operation Pushdown automata differ from normal finite state machines in two ways: # They can use the top of the stack to decide… …

    Wikipedia

  • 114Michael O. Rabin — Michael Oser Rabin Born September 1, 1931 (1931 09 01) (age 80) Breslau …

    Wikipedia

  • 115Dug North — Automaton maker Dug North with one of his creations Dug North (born August 2, 1970) is an American artist who creates hand cranked animated sculpture known as contemporary automata . Though his work is much less complex mechanically, North draws… …

    Wikipedia

  • 116Computability theory (computer science) — In computer science, computability theory is the branch of the theory of computation that studies which problems are computationally solvable using different models of computation.Computability theory differs from the related discipline of… …

    Wikipedia

  • 117Christopher Langton — Born 1948/1949 Nationality American Alma mater …

    Wikipedia

  • 118Construction and Analysis of Distributed Processes — Developer(s) the INRIA VASY team Initial release 1986, 24–25 years ago Stable release …

    Wikipedia

  • 119Nondeterministic finite state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes …

    Wikipedia

  • 120Self-replicating machine — A self replicating machine is an artificial construct that is theoretically capable of autonomously manufacturing a copy of itself using raw materials taken from its environment. The concept of self replicating machines has been advanced and… …

    Wikipedia