Re: Poll: Are PCs Turing Machines?

From: |-|erc (h_at_r.c)
Date: 12/19/04 

Date: Sun, 19 Dec 2004 13:14:16 +1000

> > is entirely no, because TMs are defined as non-physical
> > and PCs are defined as physical.
> >
>
> Again this is completely wrong! Is the sun yellow? YES

Technically its not completely wrong.

there is a TM for every FSM that doesn't use more than a fixed amount
of its memory tape.

Even though literally TMs have an infinite tape, FSMs are TMs

Turing Machines plural isn't any particular device, its a class of devices.

There is a Turing Machine that does the same computations as my PC.

Herc 

--
"YOU CANT PROVE ME"
If you prove its true then it has a proof, which makes it false.
If you don't prove it, then its true.
10,000 people in sci.math ALL believe that it means mathematics will always be incomplete.

Relevant Pages

  • Re: Poll: Are PCs Turing Machines?
    ... there is a TM for every FSM that doesn't use more than a fixed amount ... of its memory tape. ... Even though literally TMs have an infinite tape, ... Turing Machines plural isn't any particular device, ...
    (comp.theory)
  • Re: Another clueless wikipedia article
    ... I tend to think that a clear example of a device that can be only considered to be a FSM and not a more powerful computer would be much better. ... are Turing Machines anyway, so there are no examples of FSMs "that can be only considered to be a FSM" and not also a Turing Machine. ... Why skip the soda vending machine, which is a much more natural example? ... Simon ...
    (comp.theory)
  • Re: Why did genus Nicotiana (tobacco plants) Evolve?
    ... you're confusing the device controlled by an FSM with the FSM itself. ... Turing machines and finite state machines are mathematical ... Robert Grumbine http://moregrumbinescience.blogspot.com/ Science blog ... Sagredo (Galileo Galilei) "You present these recondite matters with too much ...
    (talk.origins)