This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Blum, M., "A machine independent theory of the complexity of recursive functions", JACM 14 (1967), 322–336.
Daley, R., "On the simplicity of busy beaver sets", Zeit. für Math. Logik und Grund. der Math. 24 (1978), 207–224.
Daley, R., "Busy beaver sets and the degrees of unsolvability (revised)", Technical Report 78-2 (1978), Computer Science Department, University of Pittsburgh.
Lynch, N., Meyer, A., and Fischer, M., "Relativizations of the theory of computational complexity", Transactions AMS 220 (1976), 243–287.
Rogers, H., Theory of Recursive Functions and Effective Computability, McGraw Hill (1967).
Sacks, G., "The recursively enumerable sets are dense", Annals of Math. 80 (1964), 300–312.
Shoenfield, J., Degrees of Unsolvability, North Holland (1971).
Symes, M., "The extension of machine-independent computational complexity theory to oracle machine computation and to the computation of finite functions", Ph. D. Dissertation, Department of Applied Analysis and Computer Science, University of Waterloo (1971).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daley, R.P. (1979). On the simplification of constructions in degrees of unsolvability via computational complexity. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_22
Download citation
DOI: https://doi.org/10.1007/3-540-09526-8_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09526-2
Online ISBN: 978-3-540-35088-0
eBook Packages: Springer Book Archive