home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.c++
- Path: sparky!uunet!cis.ohio-state.edu!zaphod.mps.ohio-state.edu!darwin.sura.net!jvnc.net!princeton!csservices!tyrolia!mg
- From: mg@tyrolia (Michael Golan)
- Subject: Re: self-reproducing C++ program
- Message-ID: <mg.722138417@tyrolia>
- Sender: news@csservices.Princeton.EDU (USENET News System)
- Organization: Princeton University, Dept. of Computer Science
- References: <1919@alcbel.be> <DECHC00.92Nov17210448@tohi.DMI.USherb.Ca> <c164-aa.722076580@po.berkeley.edu> <1992Nov18.113006.12935@jyu.fi>
- Date: 19 Nov 92 02:00:17 GMT
- Lines: 14
-
- sakkinen@jyu.fi (Markku Sakkinen) writes:
-
- >There is one possible problem, though.
- >When you start generating all possible legal C++ programs
- >in the order of ascending length, before the first self-reproducing
- >one you might run into an item about which you can prove _neither_
- >of the following alternatives: [...stuff deleted]
-
- C++ only runs on finite state machines (computers). So the halting question:-)
- has nothing to do with it. All C++ programs terminate or go back to the
- same state.
-
- Michael Golan
- mg@princeton.edu
-