弹球巫师如何模拟图灵机
How Pinball Wizards Simulate a Turing Machine
AI总结:
该研究提出Pinball Wizard弹球问题,通过构造双栈下推自动机的弹球模拟证明其为图灵完全,还证明替换碰撞柱为移动墙后的射线粒子追踪问题也具有图灵完全性。
摘要:
我们提出并研究了名为“Pinball Wizard(弹球巫师)”问题这一新型物理问题的计算复杂度。该问题涉及一颗理想化弹球在由单向门(外摆门)、平面墙、抛物面墙、移动平面墙以及可产生加速或减速效果的碰撞柱(bumper)组成的迷宫中运动。给定弹球的初始位置和速度,任务是判定它是否会击中指定目标点。\n通过模拟双栈下推自动机,我们证明该问题是图灵完全的——即便在二维空间中也是如此。在我们的构造中,自动机的每一步对应常数次反射。因此,判定Pinball Wizard问题的难度至少与停机问题相当。此外,我们的构造允许将碰撞柱替换为移动墙。在这种情况下,甚至可以使用以恒定速度运动的球——即所谓的射线粒子(ray particle),这证明Ray Particle Tracing(射线粒子追踪)问题也是图灵完全的。
英文摘要:
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 composed of one-way gates (outswing doors), plane walls, parabolic walls, moving plane walls, and bumpers that cause acceleration or deceleration. Given the initial position and velocity of the pinball, the task is to decide whether it will hit a specified target point. By simulating a two-stack pushdown automaton, we show that the problem is Turing-complete -- even in two-dimensional space. In our construction, each step of the automaton corresponds to a constant number of reflections. Thus, deciding the Pinball Wizard problem is at least as hard as the Halting problem. Furthermore, our construction allows bumpers to be replaced with moving walls. In this case, even a ball moving at constant speed -- a so-called ray particle -- can be used, demonstrating that the Ray Particle Tracing problem is also Turing-complete.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。