Sujet : Re: Turing Machine computable functions DON'T apply finite string transformations to inputs
De : acm (at) *nospam* muc.de (Alan Mackenzie)
Groupes : comp.theoryDate : 28. Apr 2025, 20:03:49
Autres entêtes
Organisation : muc.de e.V.
Message-ID : <vuojel$sfo$1@news.muc.de>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
User-Agent : tin/2.6.4-20241224 ("Helmsdale") (FreeBSD/14.2-RELEASE-p1 (amd64))
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).