Re: Poll: Are PCs Turing Machines?
luiroto_at_yahoo.com
Date: 12/09/04
- Next message: David C. Ullrich: "Re: Infantile authours degrading this NG."
- Previous message: r.e.s.: "Re: Graham's Number -- Practically Everyone Has It Wrong!?"
- In reply to: Stephen Harris: "Re: Poll: Are PCs Turing Machines?"
- Next in thread: Stephen Harris: "Re: Poll: Are PCs Turing Machines?"
- Reply: Stephen Harris: "Re: Poll: Are PCs Turing Machines?"
- Reply: Stephen Harris: "Re: Poll: Are PCs Turing Machines?"
- Messages sorted by: [ date ] [ thread ]
Date: 9 Dec 2004 06:27:31 -0800
Stephen Harris wrote:
> <luiroto@yahoo.com> wrote in message
> news:1102540245.045967.12450@z14g2000cwz.googlegroups.com...
> >
> > Will Twentyman wrote:
> >> Eray Ozkural exa wrote:
> >>
> >> > examachine@gmail.com (Eray Ozkural exa) wrote in message
> > news:<320e992a.0412011208.2b75bc@posting.google.com>...
> >>> The issue is simple: a PC cannot handle *all* the data a TM can
> > process.
> >> Will Twentyman
> >
> > The issue is more simple: Turing Machines does'nt exists, only
> > Turing's algorithms.
> > Same: Eratosthenes Machines does'nt exists, only Eratosthenes
Sieves.
> > Tell me, which actual TM process has been realized that a computer
> > could not manage?
Ludovicus
> >
>
> TMs are not physical and could compute 10^2300000000000 digits
> of Pi and then more than that.
> A non-physical wonder tape that magically surpasses physical
limitations.
> Turing imagined this tape. It has never been "realized". TMs don't
> do physically realized computations. None at all. PCs do, and that
> is why PCs are not Turing machines.
Harris
How a TM could *compute* 10^230000000000 digits of Pi? A computer with
enough time (without tape) *could compute* that chain of digits.
A computer program can also show in the screen the algorithm utilized
by Turing for *trying to compute* that string of digits, and say :"I
analyzed the TM method and I found that it can compute N digits of Pi"
A PC do not only realize numerical calculus, also realize mathematical
demonstrations and develop algorithms. If a mathematician can utilize
the Turing Algorithm a computer also can, and with more confidency.
"There are not worse deafs than that those who don't want to hear"
Jesus
Ludovicus
- Next message: David C. Ullrich: "Re: Infantile authours degrading this NG."
- Previous message: r.e.s.: "Re: Graham's Number -- Practically Everyone Has It Wrong!?"
- In reply to: Stephen Harris: "Re: Poll: Are PCs Turing Machines?"
- Next in thread: Stephen Harris: "Re: Poll: Are PCs Turing Machines?"
- Reply: Stephen Harris: "Re: Poll: Are PCs Turing Machines?"
- Reply: Stephen Harris: "Re: Poll: Are PCs Turing Machines?"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|