This is an example turing machine that uses a minimal brainf*** (that is really the name of the programming language, i can't do anything to change that, sorry) implementation, without any i/o instructions, because it is an example. A turing machine is a theoretical machine that writes on an infinite band of paper. It can move the band one inch left or right, increment or decrement the value written on the current part of the paper, and loop some instructions. This machine was created at the dawn of computing, when people were trying to find the way the computers would compute. Concurrent ideas were lambda calculus and stack machines. The instructions are: + increment the value on the current part of the paper. - decrement the value on the current part of the paper. < move the paper band to the left. > move the paper band to the right. [ beginning of loop instruction. If val. of cur. cell eq. 0, jump to the next "]" instruction, else, do nothing special. ] end of loop instruction. If val. of cur. cell NOT eq. 0, jump to the last "[" instruction, else, do nothing special.
