On Sat, Dec 04, 2004 at 12:36:23AM +1100, Sam Watkins wrote: > > This is provably impossible. Reference "the halting problem". > > Turing showed only that it is possible to construct an program which cannot be > proven either to halt or not to halt. The vast majority of real-world programs > are not like this. No, what he proved is that you cannot construct a general algorithm that will determine if a program will halt. That is very different. -- Dave Carrigan Seattle, WA, USA dave@rudedog.org | http://www.rudedog.org/ | ICQ:161669680 UNIX-Apache-Perl-Linux-Firewalls-LDAP-C-C++-DNS-PalmOS-PostgreSQL-MySQL Dave is currently listening to Joe Strummer and the Mescaleros - Nitcomb (Rock Art & the X-Ray Style)
Attachment:
signature.asc
Description: Digital signature