Re: Yet another Attempt at Disproving the Halting Problem

From: >parr\(*> (gniKyruaL_at_tenretnitb.moc)
Date: 08/14/04 

Date: Sat, 14 Aug 2004 22:53:02 +0000 (UTC)

"Daryl McCullough" <daryl@atc-nycorp.com> wrote in message
news:cflvbj0a3v@drn.newsguy.com...
| >parr\(*> says...
|
| Or may I call you "Laury"?

You may call me what you like. 'parr' is temporary, even fish grow
up.
|
| >Out of interest, do you think any currently produced real
computers
| >are Turing Complete? I don't think so because they can' have
| >infinite length 'tapes'. Again, I could have misunderstood.
|
| Yes, that's right. In C, you can only refer to a limited number
| of machine locations (although, really, really, huge).
|
| However, an actual program together with floppy disks is Turing
| complete: whenever the program runs out of space it just asks
| the user to please enter the next floppy disk. (Or "please enter
| the previous floppy disk"). If the user is kindly keeping track
| of the order of the floppies, that makes an actual program into
| a kind of Turing machine in which one "square of the tape" is
| an entire floppy disk, and instead of just two symbols 1 and 0,
| it has 10^10^10 symbols (however many possible floppy disk states
| there are).

Theory vs practice. Always fun.

BTW, I'm surprise you're still trying to 'help' Peter. If he's not a
Troll, he's totally out of his depth an is unlikely ever to realise
how poor his analytic abilities are. 

--
)>==ss$$%PARR(º>   Parr

Relevant Pages
Quantcast