olcott <polcott333@gmail.com> wrote:

[ .... ]

*This stipulates how outputs must be derived*
Every Turing Machine computable function is
only allowed to derive outputs by applying
finite string transformation rules to its inputs.

A turing machine does not work on strings. It is a state machine, and transitions from state to state depending on the content of its tape.
Alongside these state transitions, the machine can write to and/or move
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

--
Alan Mackenzie (Nuremberg, Germany).

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)