1. AMBOS-SPIES, K., FEJER, P., (Unveröffentlicht): Degrees of Unsolvability. e-print: http://www.cs.umb.edu/~fejer/articles/History_of_Degrees.pdf
2. BAKER, T.P., GILL, J., SOLOVAY, R. (1975): Relativizations of the P =? NP Question. In: SIAM Journal on Computing 4,4: 431–442.
3. BENNETT, Ch.H., GILL, J., (1981): Relative to a Random Oracle A, P A != NP A != co-NP A with Probability 1. SIAM Journal on Computing 10(1): 96–113.
4. CANETTI, R. et al. (1998): The Random Oracle Methodology Revisited, STOC 1998: 209–218.
5. CHAITIN, G. J. (1987): Computing the Busy Beaver Function, In: T. M. Cover, B. Gopinath, Open Problems in Communication and Computation, Springer, 1987: 108–112.