The Community for Technology Leaders
Green Image
Issue No. 05 - May (1970 vol. 19)
ISSN: 0018-9340
pp: 458-459
J. Nievergelt , Dept. of Computer Science University of Illinois
ABSTRACT
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. , pp. 458-459, May 1970, doi:10.1109/T-C.1970.222947
97 ms
(Ver 3.1 (10032016))