[EMAIL PROTECTED] wrote: > On Wed, 29 Oct 2003 12:08:20 GMT, Ben Laurie said: > > >>Duh. That's a complete misunderstanding of the halting problem - which >>is, in essence, that you can't write a program which can predict, in >>general, whether another program will halt. Its perfectly possible to >>write programs that are guaranteed to halt. > > > Correct. The point is that 'can you design a language that *guarantees* non > terminating programs' is isomorphic to the compiler solving the Halting Problem.
Partial recursive functions (no, they aren't Turing complete). Cheers, Ben. -- http://www.apache-ssl.org/ben.html http://www.thebunker.net/ "There is no limit to what a man can do or how far he can go if he doesn't mind who gets the credit." - Robert Woodruff _______________________________________________ Full-Disclosure - We believe in it. Charter: http://lists.netsys.com/full-disclosure-charter.html
