Abstract
We will show that the class of reversible cellular automata (CA) with right Lyapunov exponent 2 cannot be separated algorithmically from the class of reversible CA whose right Lyapunov exponents are at most for some absolute constant. Therefore there is no algorithm that, given as an input a description of an arbitrary reversible CA F and a positive rational number, outputs the Lyapunov exponents of F with accuracy.
Author supplied keywords
Cite
CITATION STYLE
Kopra, J. (2019). The Lyapunov Exponents of Reversible Cellular Automata Are Uncomputable. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11493 LNCS, pp. 178–190). Springer Verlag. https://doi.org/10.1007/978-3-030-19311-9_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
