Characterization of random fluctuation-based computation in cellular automata

DOI10.1016/J.INS.2016.02.046MaRDI QIDQ1615680zbMATH OpenOpenAlexFDO

Authors Jia Lee, Ferdinand Peper, Kenji Leibnitz, Ping Gu

Publication date 31 October 2018

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2016.02.046

zbMATH Keywords

Markov chaincellular automatauniversal computationrandom fluctuationsdelay-insensitive circuits

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Cellular automata (computational aspects) (68Q80)

Recommendations

• Universal computation in a simplified Brownian cellular automaton with von Neumann neighborhood
• Effect of random fluctuations on minimizing the complexity of universal asynchronous cellular automata
• Brownian cellular automata
• Fluctuation-driven computing on number-conserving cellular automata
• Efficient circuit construction in Brownian cellular automata based on a new building-block for delay-insensitive circuits

Cites work

• scientific article; zbMATH DE number 3896307 (Why is no real title available?)
• scientific article; zbMATH DE number 3898247 (Why is no real title available?)
• scientific article; zbMATH DE number 1741020 (Why is no real title available?)
• scientific article; zbMATH DE number 2113945 (Why is no real title available?)
• A guided tour of asynchronous cellular automata
• A simple model of asynchronous cellular automata exploiting fluctuation
• Asynchronous cellular automata and Brownian motion
• Asynchronous game of life
• Brownian cellular automata
• Computation by asynchronously updating cellular automata
• Delay-insensitive computation in asynchronous cellular automata
• Emergence of universal global behavior from reversible local transitions in asynchronous systems
• Fluctuation-driven computing on number-conserving cellular automata
• Fully asynchronous behavior of double-quiescent elementary cellular automata
• On conservative and monotone one-dimensional cellular automata and their particle representation
• Probability, Markov chains, queues, and simulation. The mathematical basis of performance modeling.
• Representation of reversible cellular automata with block permutations
• Reversible computing and cellular automata -- a survey
• Synchronous to asynchronous transformation of polyautomata
• Towards a Theory of Universal Speed-Independent Modules

Cited in

(7)

• Asynchronous communicating cellular automata: formalization, robustness and equivalence
• Efficient circuit construction in Brownian cellular automata based on a new building-block for delay-insensitive circuits
• Statistical complexity of Boolean cellular automata with short-term reaction-diffusion memory on a square lattice
• A universal Brownian cellular automaton with 3 states and 2 rules
• Brownian cellular automata
• Universal computation in a simplified Brownian cellular automaton with von Neumann neighborhood
• Effect of random fluctuations on minimizing the complexity of universal asynchronous cellular automata

This page was built for publication: Characterization of random fluctuation-based computation in cellular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1615680)