Editing 1223: Dwarf Fortress
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 23: | Line 23: | ||
<small> | <small> | ||
β | <sup>1</sup> The youtuber legomasta99 even | + | <sup>1</sup> The youtuber legomasta99 even build a whole programmable PC in Minecraft as can be seen [https://www.youtube.com/watch?v=SbO0tqH8f5I here]. |
<sup>2</sup>Technically, a computer is not really Turing-complete. A Turing-complete system has to have unlimited space, and that's not possible for a memory-limited computer or any software running inside it. But even if we don't have access to Turing-completeness, we can build a theoretical machine and show how it can be extended indefinitely. In a few of the games, we prove Turing-completeness in infinite variants. | <sup>2</sup>Technically, a computer is not really Turing-complete. A Turing-complete system has to have unlimited space, and that's not possible for a memory-limited computer or any software running inside it. But even if we don't have access to Turing-completeness, we can build a theoretical machine and show how it can be extended indefinitely. In a few of the games, we prove Turing-completeness in infinite variants. |