The study of artificial self-replicating structures or machines has been taking place now for
almost half a century. My goal in this article is to present an overview of research carried out …

An accessible and multidisciplinaryintroduction to cellular automata As the applicability of
cellular automata broadens and technology advances, there is a need for a concise, yet …

A reversible computing system is a “backward deterministic” system such that every state of
the system has at most one predecessor. Hence, there is no pair of distinct states that go to …

After recalling the definition of decidability and universality, we first give a survey of results
on the as exact as possible border betweeen a decidable problem and the corresponding …

This work addresses the question: What are the basic design considerations for creating a
synthetic model of the evolution of living systems (ie anartificial life'system)? It can also be …

Previous computational models of self-replication using cellular automata (CA) have been
manually designed, a difficult and time-consuming process. We show here how genetic …

The Game of Life cellular automaton is a classical example of a massively parallel collision-
based computing device. The automaton exhibits mobile patterns, gliders, and generators of …

At the beginning of this story is John von Neumann. As far back as 1948 he introduced the
idea of a theory of automata in a conference at the Hixon Symposium, September 1948 (von …

Building on the work of Von Neumann, Burks, Codd, and Langton, among others, we
introduce the first examples of asynchronous self-reproduction in cellular automata …

Due to inevitable power dissipation, it is said that nano-scaled computing devices should
perform their computing processes in a reversible manner. This will be a large problem in …