My simple car for turing

Question

I am trying to understand and implement the simplest machine for turing and would like to get feedback if I have any sense.

We have an infinite ribbon (say, an array with T with a pointer to 0 at the beginning) and the command:

( S , R , W , D , N )

S->STEP (Start at step 1)
R->READ (0 or 1)
W->WRITE (0 or 1)
D->DIRECTION (0=LEFT 1=RIGHT)
N->NEXTSTEP (Non existing step is HALT)

My understanding is that the 2-character symbol of the 3rd state is the simplest machine. 3rd state I do not understand. 2 because we use 0 and 1 for READ / WRITE.

For instance:

(1,0,1,1,2)
(1,1,0,1,2)

Starting from step 1, if Read is 0, then {Write 1, Move Right) else {Write 0, Move Right), and then go to step 2 - which does not exist, which stops the program.

What does 3 states mean? Does this machine go like a dentist? Can we simplify more?

Answer 1

, - "" "". , (, , , , , ). , . , , .:)

- , (1,0,1,1,2). , ( ) " 1 0, 1, 2." "", -, , " " " 3" .., (, , ).

, :

• Turing "", "";
• , , ;
• ( ) , HALT.

: , .

: , , , , . , A, B C. ( "1" "2" ). , () . : " " " " .. ( "1" , "2" ).

, , "". (.. , , ) 2 5 (. ).

, - , , .

Answer 2

, , . , , turing . , 3 , , .

, , , , 5 . , cstheory.stackexchange.com, / .

Answer 3

"" , : (i) (ii) (iii) , .