UNIVERSAL CONSTRUCTION AND SELF-REPRODUCTION ON SELF-TIMED CELLULAR AUTOMATA
Yousuke Takada, Teijiro Isokawa, Ferdinand Peper, Nobuyuki Matsui
Abstract
Yousuke Takada, Teijiro Isokawa, Ferdinand Peper, Nobuyuki Matsui
Abstract
This paper proposes a universal constructor implemented on a self-timed cellular automaton, which is a particular type of asynchronous cellular automaton. Our construction utilizes the asynchronous nature of the underlying cellular automaton in a direct way, as a result of which it is simpler than the conventional construction based on the simulation of a synchronous cellular automaton by an asynchronous cellular automaton. Our model employs 39 rotation-invariant rules and the state of each cell is encoded by 8 bits.
OpenAlex reports 12 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper proposes a universal constructor implemented on a self-timed cellular automaton, which is a particular type of asynchronous cellular automaton. Our construction utilizes the asynchronous nature of the underlying cellular automaton in a direct way, as a result of which it is simpler than the conventional construction based on the simulation of a synchronous cellular automaton by an asynchronous cellular automaton. Our model employs 39 rotation-invariant rules and the state of each cell is encoded by 8 bits.
Key concepts: Asynchronous cellular automaton, Cellular automaton, Mobile automaton, Continuous automaton, Block cellular automaton, Computer science, Asynchronous communication, Elementary cellular automaton