On Sat, Jul 13, 2024 at 8:37 PM Brent Meeker <[email protected]> wrote:
>> Well that certainly is not true! There is a Turing Machine for any >> computable task, but any PARTICULAR Turing Machine has a finite number of >> internal states and can only do one thing. If you want something else done >> then you are going to have to use a Turing Machine with a different set >> of internal states. > > > *> * > *Or a different tape/program. "A Turing machine is a mathematical model of > computation describing an abstract machine that manipulates symbols on a > strip of tape according to a table of rules.Despite the model's simplicity, > it is **capable of implementing any computer algorithm.**"* > Yes exactly. As I said before, if you want a Turing Machine to do something different then you've got to pick a Turing machine with a different set of internal states, or to say the same thing with different words, you've got to program it differently. For every computable function there is a Turing Machine that will compute it if it has the correct set of internal states. John K Clark See what's on my new list at Extropolis <https://groups.google.com/g/extropolis> > The number of n-state 2-symbol Turing Machines that exist is (4(n+1))^(2n), > This is because there are n-1 non-halting states, and we have n choices > for the next state, and 2 choices for which symbol to write, and 2 > choices for which direction to move the read head. So for example there > are 16,777,216 different three state Turing Machines, and 25,600,000,000 > different four state turing machines. > > > nrp > > -- > > -- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/everything-list/CAJPayv2qN1VR0HTMSu8Jq9DHjsjr6ZeghxEgcHLnhHh-2eZMyw%40mail.gmail.com.
