Ambient Intelligence: Concepts and Applications
Juan Carlos Augusto, Paul McCullagh (2007)
Computer Science and Information Systems
Similarity:
Displaying similar documents to “Computer Generated Music for an Interactive Virtual Musical Instrument”
Ambient Intelligence: Concepts and Applications
Number-conserving reversible cellular automata and their computation-universality
Kenichi Morita, Katsunobu Imai (2001)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We introduce a new model of cellular automaton called a one-dimensional number-conserving partitioned cellular automaton (NC-PCA). An NC-PCA is a system such that a state of a cell is represented by a triple of non-negative integers, and the total (i.e., sum) of integers over the configuration is conserved throughout its evolving (computing) process. It can be thought as a kind of modelization of the physical conservation law of mass (particles) or energy. We also define a reversible...
Hesperia: the electronic corpus of palaeo-hispanic inscriptions and linguistic records
Eugenio R. Luján (2005)
Review of the National Center for Digitization
Similarity:
Collision patterns on mollusc shells.
Plath, P.J., Plath, J.K., Schwietering, J. (1997)
Discrete Dynamics in Nature and Society
Similarity:
Nondeterministic forgetting automata are less powerful than deterministic linear bounded automata
Petr Jančar (1993)
Acta Mathematica et Informatica Universitatis Ostraviensis
Similarity:
Man and computer
Michal Stríženec (1974)
Kybernetika
Similarity:
Some results on cellular automata
Claudio Baiocchi (1998)
Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni
Similarity:
We want to discuss some properties of one-dimensional, radius 1, CUCAs (we denote by CUCA a Computationally Universal Cellular Automaton; see later on for the definitions). In particular, on one hand we want to keep small the number of states (the first example of «small» CUCA is due to Smith III [13]; it requires 18 states); on the other hand we are interested into automata, possibly requiring a high number of states, whose transition law is «as simple as possible»; e.g. totalistic...