"Natural" complexity measures and time versus memory: Some definitional proposals

  • Donald A. Alton
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 52)


Complexity Measure Resource Requirement Recursive Call Component Program Identical Configuration 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

6. References

  1. [1]
    D. Alton, "Natural" complexity measures and a subrecursive speed-up theorem, to appear, Proceedings of IFIP Congress '77, Toronto, Canada, August, 1977.Google Scholar
  2. [2]
    D. Alton, "Natural" complexity measures, subrecursive languages, and speed-up, Computer Science report 76-05, University of Iowa, Iowa City, Iowa 52242 U.S.A., December, 1976.Google Scholar
  3. [3]
    D. Alton, Are there lots of "natural" subrecursive programming languages and complexity measures?, in preparation.Google Scholar
  4. [4]
    D. Alton, Nonexistence of program optimizers in several abstract settings, J. Comput. System Sci. 12(1976), 368–393.Google Scholar
  5. [5]
    D. Alton and J. Lowther, Nonexistence of program optimizers: subrecursive languages and "natural" complexity measures, in preparation.Google Scholar
  6. [6]
    G. Ausiello, Abstract computational complexity and cycling computations, J. Comput. System Sci. 5(1971), 118–128.Google Scholar
  7. [7]
    M. Blum, A machine-independent theory of the complexity of recursive functions, J. Assoc. Comput. Mach. 14(1967), 322–336.Google Scholar
  8. [8]
    R. Constable, Type two computational complexity, Proceedings of Fifth Annual ACM Symposium on Theory of Computing (1973), 108–121, available from Association for Computing Machinery, New York.Google Scholar
  9. [9]
    R. Constable and A. Borodin, Subrecursive programming languages, part 1: efficiency and program structure, J. Assoc. Comput. Mach. 19(1972), 526–568.Google Scholar
  10. [10]
    J. Hartmanis, On the problem of finding natural computational complexity measures, Proceedings of the Symposium and Summer School on Mathematical Foundations of Computer Science (Mathematical Institute of the Slovak Academy of Sciences, 1973), 95–103.Google Scholar
  11. [11]
    J. Hartmanis and J. Hopcroft, An overview of the theory of computational complexity, J. Assoc. Comput. Mach. 18(1971), 444–475.Google Scholar
  12. [12]
    I. Havel, Weak complexity measures, SIGACT News (January 1971), 21–30, available from Special Interest Group on Automata and Computability Theory, Association for Computing Machinery, New York.Google Scholar
  13. [13]
    L. Landweber and E. Robertson, Recursive properties of abstract complexity classes, J. Assoc. Comput. Mach. 19(1972), 296–308.Google Scholar
  14. [14]
    J. Lowther, The non-existence of optimizers and subrecursive languages, Computer Science report 75-07, University of Iowa, Iowa City, Iowa 52242 U.S.A., December, 1975.Google Scholar
  15. [15]
    H. Rogers, Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar
  16. [16]
    D. Symes, The extension of machine-independent computational complexity theory to oracle machine computation and to the computation of finite functions, Department of Applied Analysis and Computer Science report CSRR 2057, University of Waterloo, Waterloo, Canada, October, 1971.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Donald A. Alton
    • 1
  1. 1.Department of Computer ScienceThe University of IowaIowa CityU.S.A.

Personalised recommendations