Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!uakari.primate.wisc.edu!dali.cs.montana.edu!milton!petry
From: petry@milton.u.washington.edu (David Petry)
Newsgroups: comp.theory
Subject: Re: Question on halting problem
Keywords: recursive
Message-ID: <1991May3.185947.19929@milton.u.washington.edu>
Date: 3 May 91 18:59:47 GMT
References: <Apr.25.08.44.05.1991.23782@athos.rutgers.edu> <18974@crdgw1.crd.ge.com> <4760@osc.COM>
Organization: University of Washington, Seattle
Lines: 12

In article <4760@osc.COM> jgk@osc.UUCP (Joe Keane) writes:
>
>                                                           Given a program
>which takes no input, either it halts or it doesn't.  

Am I the only one that questions the validity of the above assertion?

It seems reasonable to me to say, for example, that any program must either 
halt within one million steps, or not halt within one million steps. But
without some explicit bound, the statement seems to be without meaning.

David Petry