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: This survey overviews the past studies on RCAs, and can see even very simple RCAs have computation-universality.
Abstract: A reversible cellular automaton (RCA) is a subclass of a CA such that its global function is injective. It is considered as an abstract spatiotemporal model of a reversible physical system. In spite of the strong constraint of reversibility, an RCA has a high ability of information processing. In this survey, we overview the past studies on RCAs, and discuss how computing is performed in them. We can see even very simple RCAs have computation-universality.
8 citations
TL;DR: Starting with a Moore‐type automaton the bases for a brain‐like sequential machine are laid down and it is shown that this structure can “learn to live” in a consistent environment.
Abstract: Starting with a Moore‐type automaton the bases for a brain‐like sequential machine are laid down. The problem is considered both at the level of a physical structure and a state structure. The logic is cellular and variable to accommodate learning and generalization. It is shown that this structure can “learn to live” in a consistent environment. Concepts such as recognition and recall of environmental events, short‐term memory, data generation (analogous to speech production) and attention are shown to be natural attributes of the model.
8 citations
Posted Content•
TL;DR: A first attempt for a possible description of fluids dynamics by mean of a cellular automata technique, which permits to obtain the evolution in time for a two-dimensional grid, where one molecule of the material fluid can ideally place itself on a single geometric square.
Abstract: In this paper I present a first attempt for a possible description of fluids dynamics by mean of a cellular automata technique. With the use of simple and elementary rules, based on random behaviour either, the model permits to obtain the evolution in time for a two-dimensional grid, where one molecule of the material fluid can ideally place itself on a single geometric square. By mean of computational simulations, some realistic effects, here showed by use of digital pictures, have been obtained. In a subsequent step of this work I think to use a parallel program for a high performances computational simulation, for increasing the degree of realism of the digital rendering by mean of a three-dimensional grid too. For the execution of the simulations, numerical methods of resolution for differential equations have not been used.
8 citations
Patent•
14 Jul 1999
TL;DR: In this paper, a cellular automata neural network method for process modeling of film-substrate interactions was proposed, where variable rules describe a state change algorithm for atoms or other objects near a substrate.
Abstract: A cellular automata neural network method for process modeling of film-substrate interactions utilizes a cellular automaton system having variable rules for each cell. The variable rules describe a state change algorithm for atoms or other objects near a substrate. The state change algorithm is used to create a training set of solutions for training a neural network. The cellular automaton system is run to model the film-substrate interactions with the neural network providing the state change solutions in place of the more computationally complex state change algorithm to achieve real-time or near real-time simulations.
8 citations
01 Jan 2008
TL;DR: For the two-dimensional cellular automata, the problem of describing the dynamics of a conserved energy in a cellular automaton in terms of local movements of "particles" (quanta of that energy) has attracted some people's attention as discussed by the authors.
Abstract: The problem of describing the dynamics of a conserved energy in a cellular automaton in terms of local movements of “particles” (quanta of that energy) has attracted some people’s attention. The one-dimensional case was already solved by Fukś (2000) and Pivato (2002). For the two-dimensional cellular automata, we show that every (contextfree) conservation law can be expressed in terms of such particle displacements. Introduction Let L = Zd be the d-dimensional square lattice, and S a finite set of states. Every cellular automaton (CA for short) F : SL → SL maps the uniform configurations into the uniform configurations. Two configurations x, y : L→ S are asymptotic if they agree on all but finitely many cells of the lattice. The image of asymptotic configurations under every cellular automaton remain asymptotic. A (context-free) energy assignment is a function μ : S → R. The μ-content of a finite pattern p : A→ S (A ⊆ L finite) is the sumM(p) , ∑ i∈A μ (p[i]). For every two asymptotic configurations x, y ∈ SL, the corresponding energy difference is δM(x, y) , ∑ i∈L [μ(y[i])− μ(x[i])] (0.1) which is clearly well-defined (only a finite number of terms are non-zero). The energy μ is conserved by a cellular automaton F : SL → SL, if δM(Fx, Fy) = δM(x, y) (0.2)
8 citations