Cellular automata and intermediate degrees.

DOI10.1016/S0304-3975(02)00661-8zbMath1045.68096MaRDI QIDQ1401277

Klaus Sutner

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Cellular automataIntermediate degrees

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

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

• Unnamed Item

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.