Program size, oracles, and the jump operation
Gregory J. Chaitin · Osaka City University (Osaka City University) · 1977
There are a number of questions regarding the size of programs for calculating natural numbers, sequences, sets, and functions, which are best answered by considering computations in which one is allowed to consult an oracle for the halting problem.Questions of this kind suggested by work of T. Kamae and D. W. Loveland are treated.