Machine dependence of degrees of difficulty
HTML articles powered by AMS MathViewer
- by Michael Arbib and Manuel Blum PDF
- Proc. Amer. Math. Soc. 16 (1965), 442-447 Request permission
References
- J. Hartmanis and R. E. Stearns, On the computational complexity of algorithms, Trans. Amer. Math. Soc. 117 (1965), 285–306. MR 170805, DOI 10.1090/S0002-9947-1965-0170805-7 M. O. Rabin, Degree of difficulty of computing a function, and a partial ordering of recursive sets, Hebrew University, Jerusalem, 1960.
- Robert W. Ritchie, Classes of predictably computable functions, Trans. Amer. Math. Soc. 106 (1963), 139–173. MR 158822, DOI 10.1090/S0002-9947-1963-0158822-2
Additional Information
- © Copyright 1965 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 16 (1965), 442-447
- MSC: Primary 94.40
- DOI: https://doi.org/10.1090/S0002-9939-1965-0181538-0
- MathSciNet review: 0181538