Cellular automata and intermediate degrees.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 3861137 (Why is no real title available?)
- scientific article; zbMATH DE number 4211534 (Why is no real title available?)
- scientific article; zbMATH DE number 3896307 (Why is no real title available?)
- scientific article; zbMATH DE number 4074492 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1292563 (Why is no real title available?)
- scientific article; zbMATH DE number 1886332 (Why is no real title available?)
- scientific article; zbMATH DE number 1390016 (Why is no real title available?)
- Classifying circular cellular automata
- Computation theory of cellular automata
- Machine Configuration and Word Problems of Given Degree of Unsolvability
- On the classifiability of cellular automata
Cited in
(7)- Bulking II: Classifications of cellular automata
- Machines, Computations, and Universality
- Computational processes, observers and Turing incompleteness
- On the complex behavior of simple tag systems -- an experimental approach
- The complexity of reversible cellular automata
- Computational classification of cellular automata
- scientific article; zbMATH DE number 5469853 (Why is no real title available?)
This page was built for publication: Cellular automata and intermediate degrees.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401277)