von Neumann and Thatcher have shown that one may construct self-reproducing universal arrays using as basic cells finite automata with only 29 states. The simplicity of the components necessitates complex programming.We present a self-reproducing universal array with simple programming. This is made possible by using as basic unit a finite automaton which can execute an internal program of up to 20 instructions
This paper is a survey on the universal automaton, which is an automaton canonically associated with...
This thesis introduces cellular automata as an environment suitable for simulating complex and massi...
We present a new self-reproducing cellular automaton capable of construction and computation beyond ...
Self-reproduction in cellular automata is discussed with reference to the models of von Neumann and ...
Summary. The goal of this contribution is to describe how a universal Turing ma-chine was embedded i...
The existence of computation-universal one-dimensional cellular automata with seven states per cell ...
A recurrent topic of interest in the theory of automata has been the possibility of self-reproducing...
After a survey of the theory and some realizations of self-replicating machines, this paper presents...
After a survey of the theory and some realizations of self-replicating machines, this paper presents...
http://deepblue.lib.umich.edu/bitstream/2027.42/3954/5/bab4757.0001.001.pdfhttp://deepblue.lib.umich...
International audienceThis paper presents a 1D intrinsically universal cellular automaton with four ...
A natural question regarding the limits of automation is: What are the limits of automata, or how cl...
AbstractUniversality in cellular automata (CAs), first studied by von Neumann, has attracted much re...
This thesis continues the studies of A. Waksman (1969) in the repeated generation of finite strings ...
AbstractThis paper presents a 1D intrinsically universal cellular automaton with four states for the...
This paper is a survey on the universal automaton, which is an automaton canonically associated with...
This thesis introduces cellular automata as an environment suitable for simulating complex and massi...
We present a new self-reproducing cellular automaton capable of construction and computation beyond ...
Self-reproduction in cellular automata is discussed with reference to the models of von Neumann and ...
Summary. The goal of this contribution is to describe how a universal Turing ma-chine was embedded i...
The existence of computation-universal one-dimensional cellular automata with seven states per cell ...
A recurrent topic of interest in the theory of automata has been the possibility of self-reproducing...
After a survey of the theory and some realizations of self-replicating machines, this paper presents...
After a survey of the theory and some realizations of self-replicating machines, this paper presents...
http://deepblue.lib.umich.edu/bitstream/2027.42/3954/5/bab4757.0001.001.pdfhttp://deepblue.lib.umich...
International audienceThis paper presents a 1D intrinsically universal cellular automaton with four ...
A natural question regarding the limits of automation is: What are the limits of automata, or how cl...
AbstractUniversality in cellular automata (CAs), first studied by von Neumann, has attracted much re...
This thesis continues the studies of A. Waksman (1969) in the repeated generation of finite strings ...
AbstractThis paper presents a 1D intrinsically universal cellular automaton with four states for the...
This paper is a survey on the universal automaton, which is an automaton canonically associated with...
This thesis introduces cellular automata as an environment suitable for simulating complex and massi...
We present a new self-reproducing cellular automaton capable of construction and computation beyond ...
DOI
Add to ORKG