Jarkko Kari

Papers

Total Citations

H-Index

About

Jarkko Kari is a leading figure in the theory of cellular automata, symbolic dynamics, and reversible computation. His foundational work explores the boundaries of computation, particularly in systems where information is never lost. Kari is best known for proving the undecidability of the surjectivity problem for two-dimensional cellular automata—a landmark result that reshaped the field. His research also delves into the dynamics of tilings and the algorithmic complexity of cellular automaton behavior. With over 19 citations for his recent comprehensive survey "Foundations of Reversible Computation" (2020), Kari continues to influence both theoretical computer science and emerging applications in low-power computing and quantum simulation. His contributions have earned him a reputation for tackling deep, often intractable problems with clarity and rigor. For students and researchers, Kari’s work offers a masterclass in connecting abstract mathematical logic to the fundamental limits of what can be computed—and reversed.