A hierarchy of primitive recursive sequence functions

E. Fachini; A. Maggiolo-Schettini

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1979)

  • Volume: 13, Issue: 1, page 49-67
  • ISSN: 0988-3754

How to cite

top

Fachini, E., and Maggiolo-Schettini, A.. "A hierarchy of primitive recursive sequence functions." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 13.1 (1979): 49-67. <http://eudml.org/doc/92090>.

@article{Fachini1979,
author = {Fachini, E., Maggiolo-Schettini, A.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {Hierarchy of Primitive Recursive Sequence Functions},
language = {eng},
number = {1},
pages = {49-67},
publisher = {EDP-Sciences},
title = {A hierarchy of primitive recursive sequence functions},
url = {http://eudml.org/doc/92090},
volume = {13},
year = {1979},
}

TY - JOUR
AU - Fachini, E.
AU - Maggiolo-Schettini, A.
TI - A hierarchy of primitive recursive sequence functions
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1979
PB - EDP-Sciences
VL - 13
IS - 1
SP - 49
EP - 67
LA - eng
KW - Hierarchy of Primitive Recursive Sequence Functions
UR - http://eudml.org/doc/92090
ER -

References

top
  1. 1. G. AUSIELLO, Complessità di calcolo delle funzioni, Boringhieri, Torino, 1975. 
  2. 2. P. AXT, Iteration of Primitive Recursion, Zeisch. f. math. Logik und Grundl. d. Math., Vol. 9, 1965, pp. 253-255. Zbl0144.00201MR195719
  3. 3. H. BECK, Zur Entscheidbarkeit der funktionalen Aquivalenz, Automata Theory and Formal Languages 2nd GI Conference, Lecture Notes in Computer Science, Vol. 33, 1975, pp. 127-133. Zbl0312.68049MR432436
  4. 4. J. P. CLEAVE, A Hierarchy of Primitive Recursive Functions, Zeitsch. f. math. Logik und Grundl. d. Math., Vol. 9, 1963, pp. 331-345. Zbl0124.00303MR159754
  5. 5. A. COBHAM, The Intrinsic Computational Difficulty of Functions, Proc. Congress on Logic, Methodology and Philosophy of Science, Haifa, Israel, 1964, North-Holland, Amsterdam, 1964, pp. 24-30. Zbl0192.08702MR207561
  6. 6. S. EILENBERG and C. C. ELGOT, Iteration and Recursion, Proc. Nat.Acad. Sci.U.S.A., Vol. 61, 1968pp. 378-379. Zbl0193.31001MR241291
  7. 7. S. EILENBERG and C. C. ELGOT, Recursiveness, Academic Press, New York, 1970. Zbl0211.31101MR268040
  8. 8. G. GERMANO and A. MAGGIOLO-SCHETTINI, Quelques caractérisations des fonctions récursives partielles, C. R. Acad. Sc. Paris, t. 276, série A, 1973, pp. 1325-1327. Zbl0324.02025MR363836
  9. 9. G. GERMANO and A. MAGGIOLO-SCHETTINI, Sequence-to-Sequence Recursiveness, Information Processing Lett., Vol. 4, 1975, pp. 1-6. Zbl0311.02047MR387037
  10. 10. G. GERMANO and A. MAGGIOLO-SCHETTINI, Proving a Compiler Correct: a Simple Approach, J. Comput. System Sc,. Vol. 10, 1975, pp. 370-383. Zbl0304.68022MR371136
  11. 11. A. GRZEGORCZYK, Some Classes of Recursive Functions, Rozprawy Mathematyczne, Vol. 4, 1953, pp.1-45. Zbl0052.24902MR60426
  12. 12. H. HUWIG and V. CLAUS, Das Äquivalenzproblem für spezielle Klassen von LOOP-Programmen, Theoretical Computer Science 3rd GI Conference, Lecture Notes in Computer Science, Vol. 48, 1977, pp. 73-82. Zbl0359.68019MR520895
  13. 13. A. R. MEYER and D. M. RITCHIE, The Complexity of LOOP Programs, Proc. 22nd A.C.M. Nat: Conference, Washington, D.C., 1968, pp. 465-469. 
  14. 14. H. MÜLLER, Characterization of the Elementary Functions in Terms of Nesting of Primitive Recursions, Recursive Function Theory Newsletters, Vol. 5, 1973. 
  15. 15. R. W. RITCHIE, Classes of Recursive Functions Based on Ackermann's Function, Pacific J. Math., Vol. 15, 1965, pp. 1027-1044. Zbl0133.24903MR193013
  16. 16. H. SCHWICHTENBERG, Rekursionszahlen und die Grzegorczyk Hierarchie, Arch. Math. Logik Grundlagenforsch., Vol. 12, 1969, pp. 85-97. Zbl0213.01801MR253900
  17. 17. D. TSICHRITZIS, A note on Comparison of Subrecursive Hiérarchies, Information Processing Lett., Vol. 1, 1971, pp. 42-44. Zbl0233.68016MR305995
  18. 18. D. TSICHRITZIS, The Equivalence Problem of Simple Programs, J. Ass. Comput. Mach, Vol. 17, 1970, pp. 729-738. Zbl0209.02001MR321346

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.