activity
20032017
most citedUniversality and Decidability of Number-Conserving Cellular Automata

2 citations · 2 across the 6 of their papers we have counts for

collaborators

6 papers

cs.CC2017

Nontrivial Turmites are Turing-universal

Diego Maldonado, Anahí Gajardo, Benjamin Hellouin de Menibus +1

A Turmit is a Turing machine that works over a two-dimensional grid, that is, an agent that moves, reads and writes symbols over the cells of the grid. Its state is an arrow and, d…

cs.DM2010

Time-Symmetric Cellular Automata

Andrés Moreira, Anahi Gajardo

Together with the concept of reversibility, another relevant physical notion is time-symmetry, which expresses that there is no way of distinguishing between backward and forward t…

nlin.CG2003★ 2 cited

Universality and Decidability of Number-Conserving Cellular Automata

Andres Moreira

Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions…

nlin.CG2003

Complexity of Langton's Ant

Anahi Gajardo, Andres Moreira, Eric Goles

The virtual ant introduced by C. Langton has an interesting behavior, which has been studied in several contexts. Here we give a construction to calculate any boolean circuit with…

nlin.CG2003

On Conservative and Monotone One-dimensional Cellular Automata and Their Particle Representation

Andres Moreira, Nino Boccara, Eric Goles

Number-conserving (or {\em conservative}) cellular automata have been used in several contexts, in particular traffic models, where it is natural to think about them as systems of…

physics.bio-ph2003

Genetic Algorithms for the Imitation of Genomic Styles in Protein Backtranslation

Andres Moreira

Several technological applications require the translation of a protein into a nucleic acid that codes for it (``backtranslation''). The degeneracy of the genetic code makes this t…