Turing Programmer

Welcome to my new puzzle/sandbox map, Turing Programmer!

In this map, you will use a language of just 13 simple commands to manipulate an infinite plane of cells and calculate just about anything an actual computer can. No redstone knowledge or command block knowledge is required or used, because your program is made up entirely of different colored wool blocks that are executed in a determined order. You may think of this map as a type of cellular automaton.

Activate your imagination and create programs that can invert a row of 0s and 1s, add two numbers in base two, square and cube numbers, generate Fibonacci sequences, calculate prime factors, and generate Pythagorean triples. There is no limit to creativity in this map!

Inspired by the game Human Resource Machine by Tomorrow Corporation. Get it here.

• A simple introduction to programming!
• An easy to understand tutorial!
• Custom sounds and custom music!
• A list of challenges for you programmers out there in 4 different difficulty categories!

Your workplace is an infinite 2-dimensional grid of cells that can have one of three possible states (represented as empty, filled with 0, or filled with 1). There also is a 'selection' that can select one particular cell and store the value of a cell in its memory (either empty, 0, or 1).

Commands can be used to manipulate the selection and its currently selected cell. A program is a 3-dimensional structure that consists of vertical columns in a 2-dimensional grid.

Your program will start at the column at x=0, z=0, and move downwards until it runs out of commands, is told to loop, or gets redirected to a different column.

The commands:

• Write 0, Write 1, Clear (write a 0, 1, or empty field into the selected cell)
• Copyfrom (copies the state of the selected cell to the memory)
• Copyto (copies the state of the memory to the selected cell)
• Move north, east, south, west (moves the selection by 1 cell in the specified direction)
• Test if 0, test if 1 (logical test if the cell contains a 0/1: if so, it does the next command; if not, it skips the next command and goes directly to the second next)
• Jump north, east, south, west, or up (redirects the program to a neighboring column, or tells it to repeat the current column)
• Stop (stops and verifies the solution)

The entire thing contains just 13 commands in total, but they are enough to imitate any computer algorithm that does not contain factors of randomness. (Sometimes a few tricks are required, such as using base -2 instead of base 2 to write both positive and negative numbers without using a minus sign)

2016-08-22 - Map Released.