Relations between semantics and complexity of recursive programs-

  • Giorgio Ausiello
Tuesday Morning
Part of the Lecture Notes in Computer Science book series (LNCS, volume 14)


Complexity Measure Complexity Property Complete Lattice Recursive Function Error Message 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G.Ausiello: On bounds on the number of steps to compute functions, Second Annual Symp. on Theory of Computing, Northampton, Mass. (1970)Google Scholar
  2. [2]
    G.Ausiello: Resource bounded computations, to be publishedGoogle Scholar
  3. [3]
    M.Blum: A machine independent theory of the complexity of recursive functions, J. ACM 14 (1967)Google Scholar
  4. [4]
    R.L. Constable: Type two computational complexity, Fifth Annual ACM Symposium on Theory of Computing, Austin, Texas (1973)Google Scholar
  5. [5]
    J.W.De Bakker: Recursive procedures, Math. Centre Tracts 24, Amsterdam (1971)Google Scholar
  6. [6]
    J.Hartmanis: On the problem of finding natural complexity measures, Mathematical Foundations of Computer Science, High Tatras, Czechoslovakia (1973)Google Scholar
  7. [7]
    J.Hartmanis, J.Hopcroft: An overview of the theory of computational complexity, J. ACM 18 (1971)Google Scholar
  8. [8]
    N.Lynch: Relativization of the theory of computational complexity, MAC-TR 99, MIT (1972)Google Scholar
  9. [9]
    Z.Manna, S.Ness, J.Vuillemin: Inductive methods for proving properties of programs, ACM Conference on proving assertions about programs, Las Cruces, N.M. (1972)Google Scholar
  10. [10]
    A.Meyer, D.Ritchie: Computational complexity and program structure, RC 1817, IBM Research (1967)Google Scholar
  11. [11]
    D.M. Symes: The extension of machine independent computational complexity theory to oracle machines computations and to the computation of finite functions, Research Report CSRR 2057, Univ. of Waterloo (1971)Google Scholar
  12. [12]
    H.Rogers: Theory of recursive functions and effective computability, Mc Graw Hill (1967)Google Scholar
  13. [13]
    D.Scott: Outline of a mathematical theory of computation, Oxford University Computing Laboratory PRG-2 (1970)Google Scholar
  14. [14]
    J.Vuillemin: Correct and optimal implementations of recursion in a simple programming language, Fifth Annual ACM Symposium on Theory of Computing, Austin, Texas (1973)Google Scholar
  15. [15]
    K. Weihrauch: On the computational complexity of program schemata TR 74-196, Dept. of Computer Science, Cornell University, Ithaca, n.y. (1974)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • Giorgio Ausiello
    • 1
  1. 1.Centro Studio Sistemi di Controllo e Calcolo Automatici Consiglio Nazionale delle RicercheRomaItalia

Personalised recommendations