Descriptive Complexity of Sensitivity of Cellular Automata
Abstract
We study the computational complexity of determining whether a cellular automaton is sensitive to initial conditions. We show that this problem is 02-complete in dimension 1 and 03-complete in dimension 2 and higher. This solves a question posed by Sablik and Theyssier.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.