home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!gatech!nscf!lakes!kalki33!system
- From: kalki33!system@lakes.trenton.sc.us
- Newsgroups: talk.origins
- Subject: Re: Laying a trap
- Keywords: Computer program, random, mutation, chess
- Message-ID: <NaumuB8w165w@kalki33>
- Date: Sun, 22 Nov 92 03:47:58 EST
- References: <1992Nov20.164903@IASTATE.EDU>
- Reply-To: kalki33!system@lakes.trenton.sc.us
- Organization: Kalki's Infoline BBS, Aiken, SC, USA
- Lines: 29
-
- kv07@IASTATE.EDU (Warren Vonroeschlaub) writes:
-
- > > 5) If you are not sure whether the machine will eventually halt, then
- > > attempt to dissect the code to determine if it represents a valid
- > > algorithm or not.
- >
- > this is known as the halting problem. If you have found a solution, please
- > publish it so you can claim your Nobel prize.
-
- No, the halting problem is unsolvable. Our point was: if you give the
- machine a time interval and it is still running at the end of the
- interval, then rather than throw it out as non-halting, first spend a
- little more time trying to find something in the code that may indicate
- that it would have stopped if left alone for a little longer. That's
- all.
-
- Sincerely,
- Kalki Dasa
-
-
- -------------------------------------------------------
- | Don't forget to chant: Hare Krishna Hare Krishna |
- | Krishna Krishna Hare Hare |
- | Hare Rama Hare Rama |
- | Rama Rama Hare Hare |
- | |
- | Kalki's Infoline BBS Aiken, South Carolina, USA |
- | (kalki33!kalki@lakes.trenton.sc.us) |
- -------------------------------------------------------
-