Cellular automata and intermediate degrees.
From MaRDI portal
Publication:1401277
DOI10.1016/S0304-3975(02)00661-8zbMath1045.68096MaRDI QIDQ1401277
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (5)
The complexity of reversible cellular automata ⋮ On the complex behavior of simple tag systems -- an experimental approach ⋮ Computational processes, observers and Turing incompleteness ⋮ Bulking II: Classifications of cellular automata ⋮ Computational classification of cellular automata
Uses Software
Cites Work
- Classifying circular cellular automata
- Computation theory of cellular automata
- On the classifiability of cellular automata
- Machine Configuration and Word Problems of Given Degree of Unsolvability
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Cellular automata and intermediate degrees.