Noback Machine

This article is not detailed enough and needs to be expanded. Please help us by adding some more information.

Noback Machine is a variation of Turing machine by User:ChuckEsoteric08.

Description

Noback Machine is different from Turing-machine that there is no way to move left, instead it can only move pointer right or move pointer to the start of a tape. Tape in Noback Machine is also right-infinite because of that. Each state is represented as a 4-tuple:

(State, Initial symbol, Next symbol, Command, Next State)

Command can be either "Move right" (R) or "Move to the first cell" (F)

Computational class

Noback machine is Turing complete as it can simulate the Tag system in a similar way as brainfuck minus -.