Talk:Redstone

Is it really turing complete?

It seems like redstone has finite storage, why does boolean logic make it turing complete? - VilgotanL (talk) 19:23, 17 July 2021 (UTC)

It doesn't. I will remove the category. —User:PythonshellDebugwindow (talk) ~~~~ 00:37, 19 July 2021 (UTC)

It is Turing complete as it is possible to construct a flying machine that takes a cobblestone from an infinite cobblestone generator, flies along a line of blocks until the end, puts the cobblestone in place, and then flies back (adding 1 to a register), a similar machine that flies to the end, seperates the last block, and blows it up (subtracting 1), and a condition if the second machine couldn't move (state-switching). Thus, it is possible to implement a Minsky machine in Minecraft, ignoring world size limits. On a more technical side, using lazy-loaded chunks, it's possible to keep lit TNT in stasis while manipulating them and being able to seperate exactly 1 TNT from a pile due to subtick ordering shenanigans, which allows incrementation (TNT duping), decrementation (seperating & disposing of a TNT), and state-switching (seperation methods rely on detecting a TNT, thus it is possible to check for if that signal never came). This is more complex mechanic-wise and fragile, but is less complicated and only needs a finite space for the registers (as lit TNT is an entity & thus can be stacked infinitely into one space). Although these might not sound like redstone, both are considered subsets of it (the first called "slimestone" and the second called "technical redstone," "technical Minecraft," or just "redstone"). Hence, I've also re-added the "Turing complete" category. CreeperBomb (interact in such a way to use diction in order to achieve the result of conversation or other form of communicating an idea or group of ideas between individuals including myself) 03:08, 18 December 2024 (UTC)