Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!mips!apple!uokmax!d.cs.okstate.edu!unx2.ucc.okstate.edu!unx20491 From: unx20491@unx2.ucc.okstate.edu (Inscrutable Eric) Newsgroups: comp.theory Subject: Re: Question on halting problem Keywords: for 10 bonus points... Message-ID: <1991May2.190138.15254@unx2.ucc.okstate.edu> Date: 2 May 91 19:01:38 GMT References: <18974@crdgw1.crd.ge.com> Organization: Oklahoma State University Computer Center Lines: 29 In article <18974@crdgw1.crd.ge.com> nielsen@procyon.crd.ge.com (paul e nielsen) writes: >In article masticol@athos.rutgers.edu (Steve Masticola) writes: >> >> [Delete, delete, delete, ...] >>Give the source code for a sequential program (in the language of your >>choice) such that: >> >>* The program compiles correctly and executes without errors; > >(defun fermat () > "Find a solution to Fermat's Last Theorem" > (do ((a 1 (1+ a))) > (NIL) ; Terminates when solution found > [Delete, delete, delete, ...] I'll bet that there is no computer in the world that will execute this code without returning an error when a, or any other of the variables, exceeds the computer's MaxInt. Seems like a silly point, but this code doesn't seem to follow all of the rules. For example, it probably won't execute without errors. >P.S. Where can I redeem my 10 points? Nowhere, your code fails to comply with all of the rules for such code. ----------------------------------------------------------------------------- "I call myself `'d' Kidd,' because no one else will." unx20491@unx2.ucc.okstate.edu (Eric Gindrup) God created a countable infinity of numbers. All else is the work of consistent people. "Consistency is the hobgoblin of little minds."