Machines, Computations, and Universality
From MaRDI portal
Publication:5710892
DOI10.1007/B106980zbMATH Open1119.68121OpenAlexW4297931334MaRDI QIDQ5710892FDOQ5710892
Authors: K. Sutner 
Publication date: 8 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106980
Recommendations
Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80) Recursively (computably) enumerable sets and degrees (03D25)
Cited In (15)
- Computation and universality: Class IV versus Class III cellular automata
- Universal groups of cellular automata
- Computational equivalence and classical recursion theory
- Machines, Computations, and Universality
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cellular automata and intermediate degrees.
- Invariance and Universality of Complexity
- Behavioral complexity indicators for process algebra: The NKS approach
- Computational processes and incompleteness
- On the dynamics and recursive properties of multidimensional symbolic systems
- Title not available (Why is that?)
- Cellular automata universality revisited
- Simulation limitations of affine cellular automata
- Computational universality of fungal sandpile automata
This page was built for publication: Machines, Computations, and Universality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710892)
