Title :
On the Time Required for Timing—The Halting Problem Rephrased
fDate :
5/1/1970 12:00:00 AM
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.
Keywords :
Halting problem, time requirement.; Circuit theory; Delay; Hazards; Programming profession; Radio access networks; Switching circuits; Timing; Halting problem, time requirement.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/T-C.1970.222947
