Topic
Continuous automaton
About: Continuous automaton is a research topic. Over the lifetime, 947 publications have been published within this topic receiving 17417 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: In this article, the authors introduce a new framework for constructing topological quantum memories, by recasting error recovery as a dynamical process on a field generating cellular automaton, which does not require any global operations or complex decoding algorithms.
Abstract: We introduce a new framework for constructing topological quantum memories, by recasting error recovery as a dynamical process on a field generating cellular automaton. We envisage quantum systems controlled by a classical hardware composed of small local memories, communicating with neighbours, and repeatedly performing identical simple update rules. This approach does not require any global operations or complex decoding algorithms. Our cellular automata draw inspiration from classical field theories, with a Coulomb-like potential naturally emerging from the local dynamics. For a 3D automaton coupled to a 2D toric code, we present evidence of an error correction threshold above 6.1% for uncorrelated noise. A 2D automaton equipped with a more complex update rule yields a threshold above 8.2%. Our framework provides decisive new tools in the quest for realising a passive dissipative quantum memory.
7 citations
01 Jan 1994
TL;DR: An on-line and decentralized path-planning algorithm for multiple automata and its deadlock-free characteristic in an infinite 2-d world is proposed and discussed.
Abstract: In this paper, we propose an on-line and decentralized path-planning algorithm for multiple automata and then discuss its deadlock-free characteristic in an infinite 2-d world. In this research, we consider many automata with a finite number in the world without any static obstacle. Each automaton with the same circular shape can move for omni-directions to arrive at the goal. An automaton basically does not see any information except its present position in an on-line manner, and therefore usually goes straight to the goal and finally stops at it. However an automaton exceptionally knows a behavior of another colliding one by its ring of tactile sensors, and in a real time way, it processes the present own and partner’s behaviors to determine its next own behavior by the common sense.
7 citations
Posted Content•
TL;DR: A new Life-like cellular automaton capable of logic universality -- the X-rule, which is 2D, binary, with a Moore neighborhood and $\lambda$ parameter similar to the game-of-Life, but is not based on birth/survival and is non-isotropic.
Abstract: We present a new Life-like cellular automaton (CA) capable of logic universality -- the X-rule. The CA is 2D, binary, with a Moore neighborhood and $\lambda$ parameter similar to the game-of-Life, but is not based on birth/survival and is non-isotropic. We outline the search method. Several glider types and stable structures emerge spontaneously within X-rule dynamics. We construct glider-guns based on periodic oscillations between stable barriers, and interactions to create logical gates.
7 citations
TL;DR: In this paper, the authors present a preliminary study of two-input one-dimensional cellular automaton rules called eventually number-conserving cellular automata rules whose limit sets, reached after a number of time steps of the order of the cellular automaten size, consist of states having a constant number of active sites.
Abstract: Although it is undecidable whether a one-dimensional cellular automaton obeys a given conservation law over its limit set, it is however possible to obtain sufficient conditions to be satisfied by a one-dimensional cellular automaton to be eventually number-conserving. We present a preliminary study of two-input one-dimensional cellular automaton rules called eventually number-conserving cellular automaton rules whose limit sets, reached after a number of time steps of the order of the cellular automaton size, consist of states having a constant number of active sites. In particular, we show how to find rules having given limit sets satisfying a conservation rule. Viewed as models of systems of interacting particles, these rules obey a kind of Darwinian principle by either annihilating unnecessary particles or creating necessary ones.
7 citations
11 Apr 2013
TL;DR: It has been verified that the finite automaton with number of printing (output) symbols determined by the maximum out degree of a cell in the underlying semi-regular grid can find the target.
Abstract: Path discovery or routing algorithms are challenging when the nodes are distributed over not on just regular grid like rectangular type but on semiregular grids Investigations in the study of finite state automata that move about in a two dimensional space are suitable to tackle this context The model proposed by H Muller [1] is used here to construct new automaton which can explore the path through obstacles over the grid This model is to be applied for routing phase for data transmission The earlier results were shown for static obstacles distributed over integer grid and the automaton in this case was constructed to interact on the rectangular grid location endowed with four neighborhood directional states In this paper we allow higher degree of neighborhood and mixing the types cells It has been verified that the finite automaton with number of printing (output) symbols determined by the maximum out degree of a cell in the underlying semi-regular grid can find the target
7 citations