On Tue, 4 Aug 1998, Paul Leach wrote: > The possibility of infinite loops and infinite recursion in HTML has been > discussed on the lists before. Trying to detect and prevent them is an > instance of the "Turing machine halting" problem, and it is well known among > computer scientists to be impossible. Certainly not. HTML is not Turing-complete. In fact, detecting and preventing infinite loops and recursion in HTML simply requires traversing a directed acyclic graph and determining that it is, in fact, acyclic. This is simple. Perhaps you're thinking of DHTML. Or perhaps you're thinking of some kind of evil, twisted web server that serves up the same page under an infinite number of different names, each modified to include a frame reference to that page under a different name. Kragen
This archive was generated by hypermail 2b30 : Fri Apr 13 2001 - 14:11:16 PDT