Additional Key Words and Phrases: recursion theory, Turing machines, effective operators, partial recursive operators, behavior, structure, black boxes, computational complexity, Manuel Blum, Hartmanis and Stearns, enumerations, algorithms
Selected papers that cite this one
- Leonard Bass and Paul Young. Ordinal hierarchies and naming complexity classes. Journal of the ACM, 20(4):668-686, October 1973.
- Judy Goldsmith and Steven Homer. Scalability and the isomorphism problem. Information Processing Letters, 57(3):137-143, 12 February 1996.
- J. Hartmanis and J. E. Hopcroft. An overview of the theory of computational complexity. Journal of the ACM, 18(3):444-475, July 1971.
- L. H. Landweber and E. L. Robertson. Recursive properties of abstract complexity classes. Journal of the ACM, 19(2):296-308, April 1972.
- Paul R. Young. Speed-ups by changing the order in which sets are enumerated (preliminary version). In Conference Record of ACM Symposium on Theory of Computing, pages 89-92, Marina del Rey, California, 5-7 May 1969.
Selected references
- Manuel Blum. A machine-independent theory of the complexity of recursive functions. Journal of the ACM, 14(2):322-336, April 1967.
- Manuel Blum. On the size of machines. Information and Control, 11(3):257-265, September 1967.