The fundamental details of the machine were published in von Neumann's book Theory of Self-Reproducing Automata, completed in 1966 by Arthur W. The grid can be in any finite number of dimensions.

Cellular automata, as with other multi-agent system models, usually treat time as discrete and state updates as occurring synchronously.

We will then show that, conversely, there are some cases where randomness can be an aid for computing with CA and, as an example, present how to solve the Density Classification Problem with an arbitrary precision.

In spite of these facts, I found this paper, which was not included in the ALIFE IV proceedings, has been referred to by eleven papers and the article of Asynchronous Cellular Automaton in Wikipedia (in March 2007).

Opinions differ widely as to the type of architecture most suitable for achieving the tremendous performance gains expected with computers built by nanotechnology.

In this context little research effort has gone into asynchronous cellular arrays, an architecture that is promising for nanocomputers due to (1) its regular structure of locally interconnected cells, and (2) its asynchronous mode of timing.

The first facilitates bottom-up manufacturing techniques like directed self-assembly.

After a review of some basic properties we are going to explore their dynamical behavior and its specificities.

Pedro de Oliveira (Mackenzie Presbyterian University, São Paulo, Brazil) Conceptual connections around density determination in cellular automata A recurring and well studied benchmark problem in the context of computations with cellular automata is the attempt to determine which is the most frequent cell state in an arbitrary initial configuration.

This site stores nothing other than an automatically generated session ID in the cookie; no other information is captured.

In general, only the information that you provide, or the choices you make while visiting a web site, can be stored in a cookie.

Our results may be a step towards future nanocomputers with a huge number of autonomously operating cells organized in homogeneous arrays that can be programmed by configuring them as delay-insensitive circuits.