Advertisement

Erweiterungen subrekursiver Programmiersprachen

  • R. Verbeek
Theorie Der Programmierung
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2)

Keywords

Recursive Function Dann Gilt Nach Lemma 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. [1]
    M. Blum, A machine — independent theory of the complexity of the recursive functions, JACM 14 (1967) S. 322–336Google Scholar
  2. [2]
    R. L. Constable und A. B. Borodin, Subrecursive programming languages, part I: efficiency and program structure, JACM 19 (1972) S. 526–568Google Scholar
  3. [3]
    A. Grzegorczyk, Some classes of recursive functions, Rozprawy Mathematcysne, Nr. 4, Instytut Mathematyczny Polskiej Akademie Nauk, Warschau 1953, S.1–45Google Scholar
  4. [4]
    A. R. Meyer und D. M. Ritchie, Computational complexity and program structure, IBM Research Report, RC-1817Google Scholar
  5. [5]
    A. R. Meyer und D. M. Ritchie, A classification of the recursive functions, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 18 (1972), S. 71–82.Google Scholar

Copyright information

© Springer-Verlag 1973

Authors and Affiliations

  • R. Verbeek

There are no affiliations available

Personalised recommendations