What Specific Blocks are needed for Turing Completeness?
//ads -- adsterra.com -- native banner
?>
Let's say I want to make a shop with all the redstone components required for Turing-completeness. Since we know Minecraft is Turing-complete, what are the basic blocks required? Ex: Comparators might be useful, but they would not be required for Turing-completeness. Would a redstone torch, any kind of block, redstone, and repeaters all that would be necessary?
Thanks
Pictures about "What Specific Blocks are needed for Turing Completeness?"



What is required to be Turing-complete?
For example, an imperative language is Turing-complete if it has conditional branching (e.g., "if" and "goto" statements, or a "branch if zero" instruction; see one-instruction set computer) and the ability to change an arbitrary amount of memory (e.g., the ability to maintain an arbitrary number of data items).How do you prove Turing completeness?
To prove that a language or device is Turing Complete all you have to do is show that it can be used to implement a Universal Turing machine. A language that has a default flow of control, conditional execution and repetition is Turing Complete with only minor additional requirements.Are Minecraft command blocks Turing-complete?
Vanilla Minecraft is most likely Turing Complete due to the combination of command block cloning (for unbounded memory), teleportation (for chunk loading), and block update detection (a component for self-identifying cloning devices).Turing Complete - Computerphile
Sources: Stack Exchange - This article follows the attribution requirements of Stack Exchange and is licensed under CC BY-SA 3.0.
Images: Sandro Sandrone Lazzarini, DS stories, Sharon McCutcheon, Tatiana Syrikova
