On the public citation graph

On the computational power of totalistic cellular automata

0 signed · 29 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4615-8249-6_4openalex-snapshot
The Mathematical Theory of L Systems
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0167-2789(84)90245-8openalex-snapshot
Universality and complexity in cellular automata
inferredcites →https://doi.org/10.1016/0304-3975(84)90015-xopenalex-snapshot
Characterizations and computational complexity of systolic trellis automata
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1038/scientificamerican0171-104openalex-snapshot
Mathematical Games
inferredcites →https://doi.org/10.1038/scientificamerican0685-18openalex-snapshot
Computer Recreations
inferredcites →https://doi.org/10.1049/ip-i-1.1981.0010openalex-snapshot
Introduction to V.L.S.I. Systems
inferredcites →https://doi.org/10.1103/revmodphys.55.601openalex-snapshot
Statistical mechanics of cellular automata
inferredcites →https://doi.org/10.1109/t-c.1974.223995openalex-snapshot
On Some Open Problems in the Theory of Cellular Automata
inferredcites →https://doi.org/10.1145/321650.321652openalex-snapshot
Simple Computation-Universal Cellular Spaces
inferredcites →https://doi.org/10.1145/800152.804917openalex-snapshot
Developmental systems and languages
inferredcites →https://doi.org/10.2307/2004866openalex-snapshot
Theories of Abstract Automata
inferredcites →https://doi.org/10.2307/2005041openalex-snapshot
Theory of Self-Reproducing Automata
inferredcites →https://doi.org/10.2307/2313471openalex-snapshot
Computation: Finite and Infinite Machines.
inferredcites →https://doi.org/10.7146/dpb.v3i33.6453openalex-snapshot
The Mathematical Theory of L Systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-642-77905-3_4openalex-snapshot
Semi-totalistic Automata
inferred← citeshttps://doi.org/10.1007/bfb0036195openalex-snapshot
Cellular automata universality revisited
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90145-7openalex-snapshot
On totalistic systolic networks
inferred← citeshttps://doi.org/10.1016/0895-7177(88)90516-xopenalex-snapshot
The power of totalistic cellular automata and totalistic systolic networks
inferred← citeshttps://doi.org/10.1016/j.chaos.2011.09.012openalex-snapshot
Dynamic modularity in discrete-time models of regulatory networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.03.006openalex-snapshot
Complexity of reachability problems for finite discrete dynamical systems
inferred← citeshttps://doi.org/10.1016/j.jocs.2015.09.004openalex-snapshot
On the decomposition of stochastic cellular automata
inferred← citeshttps://doi.org/10.1016/j.procs.2024.01.147openalex-snapshot
Creative and Adversarial Cellular Automata for Simulating Resilience in Industry 5.0
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.04.024openalex-snapshot
On Goles’ universal machines: A computational point of view
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00073-2openalex-snapshot
Introduction to the special issue on cellular automata
inferred← citeshttps://doi.org/10.25088/complexsystems.22.4.405openalex-snapshot
On the Iota-Delta Function: Mathematical Representation of Two-Dimensional Cellular Automata
inferred← citeshttps://doi.org/10.3103/s0147688217050057openalex-snapshot
Computability via Cellular Automata
inferred← citeshttps://doi.org/10.48550/arxiv.0907.1056openalex-snapshot
Open Regulatory Networks and Modularity
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.