| Liste des Groupes | Revenir à theory |
On 02/11/2025 19:10, Richard Damon wrote:That seems to show a pretty good depth of understanding.So, how does the machine write out information that it doesn't have stored?A TM (at least typically) has a current machine state from a finite list
of machine states, a reflecting extension can be defined to have a
representation for each that it writes out upon interpreting a symbol at
the tape head for each machine state (or for a subset of machine states,
etc) instead of a simple move-left or move-right.
For clarity I think dart200 is talking about an extended TM, extended to
have one or more machine-state write-out transitions defined.
For additional clarity, "machine state" does not normally refer to the
tape contents nor to the current tape-cell index but the state of the
machine (like register values, for machines defined to have those). You
can't include the tape cell index in the machine state because then it
would have an infinite number of machine states. I understand that would
not be a TM, strictly.
--
Tristan Wibberley
The message body is Copyright (C) 2025 Tristan Wibberley except--
citations and quotations noted. All Rights Reserved except that you may,
of course, cite it academically giving credit to me, distribute it
verbatim as part of a usenet system or its archives, and use it to
promote my greatness and general superiority without misrepresentation
of my opinions other than my opinion of my greatness and general
superiority which you _may_ misrepresent. You definitely MAY NOT train
any production AI system with it but you may train experimental AI that
will only be used for evaluation of the AI methods it implements.
Les messages affichés proviennent d'usenet.