- reversible automaton
- мат. обратимый автомат, автомат без потери информации
Большой англо-русский и русско-английский словарь. 2001.
reversible automaton
Смотреть что такое "reversible automaton" в других словарях:
Reversible computing — is a model of computing where the computational process to some extent is reversible, i.e., time invertible. A necessary condition for reversibility of a computational model is that the transition function mapping states to their successors at a… … Wikipedia
Block cellular automaton — The Margolus neighborhood for a two dimensional block cellular automaton. The partition of the cells alternates between the set of 2 × 2 blocks indicated by the solid blue lines, and the set of blocks indicated by the dashed red lines. A block… … Wikipedia
Cellular automaton — A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory, mathematics, theoretical biology and microstructure modeling. It consists of a regular grid of cells , each in one of a finite number of states … Wikipedia
Garden of Eden (cellular automaton) — An orphan pattern in Conway s Game of Life, discovered by R. Banks in 1971.[1] … Wikipedia
Second order cellular automaton — A second order cellular automaton is a reversible cellular automaton (CA) where the state of a cell at time t depends not only on its neighborhood at time t 1 , but also on its state at time t 2 . Specifically, the neighborhood at t 1 is used to… … Wikipedia
Quantum dot cellular automaton — Quantum Dot Cellular Automata (sometimes referred to simply as quantum cellular automata, or QCA) Any device designed to represent data and perform computation, regardless of the physics principles it exploits and materials used to build it, must … Wikipedia
Curtis–Hedlund–Lyndon theorem — The Curtis–Hedlund–Lyndon theorem is a mathematical characterization of cellular automata in terms of their symbolic dynamics. It is named after Morton L. Curtis, Gustav A. Hedlund, and Roger Lyndon; in his 1969 paper stating the theorem, Hedlund … Wikipedia
Norman 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… … Wikipedia
Quantum cellular automata — (QCA) refers to any one of several models of quantum computation, which have been devised in analogy to conventional models of cellular automata introduced by von Neumann. It may also refer to quantum dot cellular automata, which is a proposed… … Wikipedia
Garden of Eden (cellular automata) — In a cellular automaton, a Garden of Eden configuration is a configuration which cannot appear on the lattice after one time step, no matter what the initial configuration. In other words, these are the configurations with no predecessors.They… … Wikipedia
Billiard ball computer — Fredkin and Toffoli Gate billiard ball model A billiard ball computer, also known as a conservative logic circuit, is an idealized model of a reversible mechanical computer based on newtonian dynamics, proposed in 1982 by Edward Fredkin and… … Wikipedia
