Liste des Groupes | Revenir à c theory |
olcott <polcott333@gmail.com> wrote:Where the tape holds the finite string of tape symbols of the input.
[ .... ]
*This stipulates how outputs must be derived*A turing machine does not work on strings. It is a state machine, and
Every Turing Machine computable function is
only allowed to derive outputs by applying
finite string transformation rules to its inputs.
transitions from state to state depending on the content of its tape.
Alongside these state transitions, the machine can write to and/or moveI call them final halt states.
the tape. Some of these states are terminating states, others are not.
---- Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer
Les messages affichés proviennent d'usenet.