On Fri, 25 Jan 2002, Robert Dewar wrote: > <<Not quite, it's more like saying that it's hard to prove a set of > programs with some set of properties halts, because in general the > halting problem is undecidable. > >> > > And this is false. > For the sake of seeing this thread die, as it has nothing to do with gcc, i'll just grin and agree, rather than argue. --Dan