Quantum-inspired identification of complex cellular automata
Open Access
- 19 June 2023
- journal article
- research article
- Published by Springer Nature in The European Physical Journal Plus
- Vol. 138 (6) , 1-12
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- FQXi-RFP-1809 from the Foundational Questions Institute and Fetzer Franklin Fund, a donor advised fund of Silicon Valley Community Foundation (RFP-1809)
- Imperial College Borland Fellowship in Mathematics
- Quantum Engineering Programme (QEP2-02-P06)
- National Research Foundation Singapore (NRF2021-606)
- Ministry of Education - Singapore (RG190/17)
- Lee Kuan Yew Endowment Fund
- University of Manchester Dame Kathleen Ollerenshaw Fellowship
This publication has 54 references indexed in Scilit:
- How to make dull cellular automata complex by adding memory: Rule 126 case studyComplexity, 2010
- The Computational Structure of Spike TrainsNeural Computation, 2010
- Thermodynamic depth of causal states: Objective complexity via minimal representationsPhysical Review E, 1999
- Languages, equicontinuity and attractors in cellular automataErgodic Theory and Dynamical Systems, 1997
- The kink of cellular automaton rule 18 performs a random walkJournal of Statistical Physics, 1992
- Inferring statistical complexityPhysical Review Letters, 1989
- Classes of linear automataErgodic Theory and Dynamical Systems, 1987
- Long-range effects in an elementary cellular automatonJournal of Statistical Physics, 1986
- Cellular automata as models of complexityNature, 1984
- On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural NumbersJournal of the ACM, 1969