Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)

 
 

 

Machine dependence of degrees of difficulty


Authors: Michael Arbib and Manuel Blum
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
Full-text PDF Free Access

References | Similar Articles | Additional Information

References [Enhancements On Off] (What's this?)

  • [1] J. Hartmanis and R. E. Steams, On the computational complexity of algorithms, Trans. Amer. Math. Soc. 117 (1965), 285-306. MR 0170805 (30:1040)
  • [2] M. O. Rabin, Degree of difficulty of computing a function, and a partial ordering of recursive sets, Hebrew University, Jerusalem, 1960.
  • [3] R. W. Ritchie, Classes of predictably computable functions, Trans. Amer. Math. Soc. 106 (1963), 139-173. MR 0158822 (28:2045)

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 94.40

Retrieve articles in all journals with MSC: 94.40


Additional Information

DOI: https://doi.org/10.1090/S0002-9939-1965-0181538-0
Article copyright: © Copyright 1965 American Mathematical Society

American Mathematical Society