Computing on a Simple Asynchronous Cellular Automaton
Jia Lee, Ferdinand Peper, Katsunobu Imai
Abstract
Jia Lee, Ferdinand Peper, Katsunobu Imai
Abstract
An asynchronous cellular automaton (ACA) is a cellular automaton which allows cells to undergo state transitions independently at random timings. This paper gives an efficient scheme to compute on a special ACA model that takes a substantially simple transition function. This ACA has much less complexity as compared to other models with respect to the number of transition rules.
OpenAlex reports 1 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.
An asynchronous cellular automaton (ACA) is a cellular automaton which allows cells to undergo state transitions independently at random timings. This paper gives an efficient scheme to compute on a special ACA model that takes a substantially simple transition function. This ACA has much less complexity as compared to other models with respect to the number of transition rules.
Key concepts: Cellular automaton, Asynchronous cellular automaton, Block cellular automaton, Asynchronous communication, Computer science, Simple (philosophy), Stochastic cellular automaton, Continuous automaton