I proved Turing-completeness of the programming language Piet by defining a translation from brainfuck to Piet. translation approach 1. Correspond brainfuck's tape and piet's stack. The top of the piet's stack must equal to the value that the brainfuck's pointer indicates. The second top must equal to current index of pointer, plus 3. The third top must equal to total length of the whole tape, plu