This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Time Required for Timing?The Halting Problem Rephrased
May 1970 (vol. 19 no. 5)
pp. 458-459
J. Nievergelt, Dept. of Computer Science University of Illinois
The proof of the unsolvability of the halting problem can be reformulated to show that, in general, the best one can do to estimate the run time of programs is to execute them.
Index Terms:
Halting problem, time requirement.
Citation:
J. Nievergelt, "On the Time Required for Timing?The Halting Problem Rephrased," IEEE Transactions on Computers, vol. 19, no. 5, pp. 458-459, May 1970, doi:10.1109/T-C.1970.222947
Usage of this product signifies your acceptance of the Terms of Use.