The 2D ray tracing problem with ABCD lenses and mirrors is Turing complete.
What do reversible programs compute? In Martin Hofmann, editor, Foundations of Software Science and Computational Structures, pages 42–56, Berlin, Heidelberg, 2011
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The 2D Ray Tracing Problem using ABCD Lenses and Mirrors is Turing Complete
The 2D ray tracing problem with ABCD lenses and mirrors is Turing complete.