Turing Machine Examples
Versandkostenfrei!
Versandfertig in 6-10 Tagen
22,99 €
inkl. MwSt.
PAYBACK Punkte
11 °P sammeln!
High Quality Content by WIKIPEDIA articles! With regard to what actions the machine actually does, Turing (1936) (Undecidable p. 121) states the following: "This table (and all succeeding tables of the same kind) is to be understood to mean that for a configuration described in the first two columns the operations in the third column are carried out successively, and the machine then goes over into the m-configuration in the final column." Thus when printing he skips every other square. The printed-on squares are called F-squares; the blank squares in between may be used for "markers" and are ...
High Quality Content by WIKIPEDIA articles! With regard to what actions the machine actually does, Turing (1936) (Undecidable p. 121) states the following: "This table (and all succeeding tables of the same kind) is to be understood to mean that for a configuration described in the first two columns the operations in the third column are carried out successively, and the machine then goes over into the m-configuration in the final column." Thus when printing he skips every other square. The printed-on squares are called F-squares; the blank squares in between may be used for "markers" and are called "E-squares" as in "liable to erasure." The F-squares in turn are his "Figure squares" and will only bear the symbols 1 or 0 symbols he called "figures" (as in "binary numbers").
