3 papers
cs.CC2026
The 2D Ray Tracing Problem using ABCD Lenses and Mirrors is Turing Complete
Rosemary U. Adejoh, Andreas Jakoby, Sneha Mohanty +1
We establish that the two-dimensional ray tracing problem with thin lenses and plane mirrors is Turing-complete, thereby resolving an open question posed by Reif et al. in 1994 as…
cs.CL2026
Overview of PAN 2026: Voight-Kampff Generative AI Detection, Text Watermarking, Multi-Author Writing Style Analysis, Generative Plagiarism Detection, and Reasoning Trajectory Detection
Janek Bevendorff, Maik Fröbe, André Greiner-Petter +9
The goal of the PAN workshop is to advance computational stylometry and text forensics via objective and reproducible evaluation. In 2026, we run the following five tasks: (1) Voig…
cs.CC2025
How Pinball Wizards Simulate a Turing Machine
Rosemary Adejoh, Andreas Jakoby, Sneha Mohanty +1
We introduce and investigate the computational complexity of a novel physical problem known as the Pinball Wizard problem. It involves an idealized pinball moving through a maze co…