A process encodes input data into the cells of the bottom-two rows of a playfield that is infinite in width and height, but bounded by the floor. An agent drops tetrominoes onto those cells, forming a structure that emulates combinational logic. A process decodes output data from the top-two rows of that structure:

The agent builds a second structure above the first, such that the output rows of the first structure serve as the input rows of the second structure. By repeating this procedure, the agent effectuates a state machine, where the data rows are states and the structures are transition functions:

There exists a modification of this technique where the data capacity of a state always exceeds its predecessor. The modification provides a way to build an abstract computing device with unbounded storage that can simulate an arbitrary Turing machine operating on given input.