递归不是递归：一个不和谐的结果
Recursed is not Recursive: A Jarring Result
摘要：
Recursed是一款2D益智平台视频游戏，特色是宝箱，当跳进去时，实例化一个房间，稍后可以退出（类似于函数调用），可选地生成一个返回该房间的jar（类似于continuations）。我们证明了递归是RE-完全的，因此不可判定的（不是递归的）从邮政对应问题的减少。我们的减少是“实用的”：从PCP的减少导致完全可玩的水平，遵守所有限制管理水平（包括15 x20房间大小）设计的主要游戏。我们的减少也是“有效的”：一个图灵机可以模拟递归水平的大小是线性的编码大小的图灵机和解决方案的长度是多项式的运行时间的图灵机。
英文摘要：
Recursed is a 2D puzzle platform video game featuring treasure chests that, when jumped into, instantiate a room that can later be exited (similar to function calls), optionally generating a jar that returns back to that room (similar to continuations). We prove that Recursed is RE-complete and thus undecidable (not recursive) by a reduction from the Post Correspondence Problem. Our reduction is "practical": the reduction from PCP results in fully playable levels that abide by all constraints governing levels (including the 15x20 room size) designed for the main game. Our reduction is also "efficient": a Turing machine can be simulated by a Recursed level whose size is linear in the encoding size of the Turing machine and whose solution length is polynomial in the running time of the Turing machine.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
