Re: Lambda Calculus and Turing Equivalence

From: Luis A. Rodriguez (luiroto_at_yahoo.com)
Date: 12/06/04 

Date: 5 Dec 2004 15:01:05 -0800

poopdeville@gmail.com (Acid Pooh) wrote in message is not of infinite length. > >>
> Geez -- he's shown that a TM can do something that a computer cannot.
> If computers and TMs had the same computational power, a computer
> would be able to calculate pi. Modus tollens tells us that TMs and
> PCs don't have the same computational power. Your blatant disregard
> for Leibniz's Law appears schizophrenic.
>
> 'cid'ooh

 Which TM has already calculated all the digits of pi?
 With unbounded tape and Borwein Algorithm a TM can calculate pi.Also,
with unlimited time and Borwein Algorithm a PC can will show in the
screen one by one, all the digits of pi. No need of embarrasing tapes.
Ludovicus