Papers › Descriptive Complexity of Sensitivity of Cellular Automata
Descriptive Complexity of Sensitivity of Cellular Automata
Tom Favereau, Ville Salo
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We study the computational complexity of determining whether a cellular automaton is sensitive to initial conditions. We show that this problem is Π⁰₂-complete in dimension 1 and Σ⁰₃-complete in dimension 2 and higher. This solves a question posed by Sablik and Theyssier.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections