home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.crypt
- Path: sparky!uunet!news.univie.ac.at!chx400!bernina!neptune!marti
- From: marti@inf.ethz.ch (Robert Marti)
- Subject: Re: Cryptography and P=NP
- Message-ID: <1992Nov21.162515.21287@neptune.inf.ethz.ch>
- Sender: news@neptune.inf.ethz.ch (Mr News)
- Nntp-Posting-Host: mint.inf.ethz.ch
- Organization: Dept. Informatik, ETH Zurich, Switzerland
- References: <1992Nov19.172719.1540@fid.morgan.com> <1992Nov19.193036.26711@rchland.ibm.com> <722206613@pike.cs.duke.edu>
- Date: Sat, 21 Nov 1992 16:25:15 GMT
- Lines: 29
-
- In article <722206613@pike.cs.duke.edu> srt@duke.cs.duke.edu
- (Stephen R. Tate) writes:
- > Huh? I can think of very, very few algorithms (programs) that can not
- > be counted on to halt.
-
- Really? Well, since "very, very few" is a somewhat ill defined concept
- in mathematics, I can't even disagree with you. Do you mean
- - "there are fewer than M algorithms (programs) that cannot be counted
- on to halt" or
- - "there is a possibly infinite but countable number of algorithms
- (programs) that cannot be counted on to halt" or ... ?
-
-
-
- > To re-iterate: programs that cannot be counted on to halt are very,
- > very, very rare. Most people will never see one.
-
- I not only have seen one, I even have written one, albeit unintentionally.
- By the above statement, this probably makes my a special person in some
- sense -- if only especially stupid, maybe ;-) (Then again, I seem
- to recall other people telling me that they found out that they had
- an endless loop in their program. Oh, well ... )
-
-
- --
- Robert Marti | Phone: +41 1 254 72 60
- Informationssysteme | FAX: +41 1 262 39 73
- ETH-Zentrum | E-Mail: marti@inf.ethz.ch
- CH-8092 Zurich, Switzerland |
-