Treffer: A new approach to Turing completeness in Baba is You.

Baba is You is a 2019 indie puzzle game whose levels are two-dimensional grids of objects. This paper demonstrates how a universal Turing machine could be created as a custom level in the game if a specific in-game limit were to be removed. A player could perform any computation by playing this level, allowing infinitely many new and meaningful puzzles to be created. Furthermore, the construction is such that the level is won if and only if the Turing machine halts, proving perfect play of the game to be unattainable by any computer. The machine is found to be exponentially time-complex, and the paper concludes with a discussion of the practical feasibility of in-game computation. [ABSTRACT FROM AUTHOR]

Copyright of International Journal of High School Research is the property of Terra Science & Education and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)