"Dan Minette" <[EMAIL PROTECTED]> wrote: > >From: "William T Goodall" <[EMAIL PROTECTED]> > > > It hasn't. Every undergraduate in computer science learns (I assume) >about > > Turing Machines, the Halting Problem, Godel, Skolem, predicate calculus >and > > etcetera and so forth. Anyone who does an advanced degree in AI knows >all > > this stuff backwards. > >Formal systems are actually complete? There exists a universal Turing >Machine?
Do you claim that humans can *always* answer the question "this program will or will not halt in finite time" given any program and its inputs? I merely claim that we can *often* devise tests on-the-fly for any given program and its inputs, with a rate approaching 100% for toy systems with a human-countable number of states. Joshua PS: No, claiming that Win9x will blue-screen in finite time regardless of the input is not proof of the Halting Problem. ;-) _________________________________________________________________ MSN Photos is the easiest way to share and print your photos: http://photos.msn.com/support/worldwide.aspx
