@article{ITA_1979__13_1_49_0, author = {Fachini, E. and Maggiolo-Schettini, A.}, title = {A hierarchy of primitive recursive sequence functions}, journal = {RAIRO. Informatique th\'eorique}, pages = {49--67}, publisher = {EDP-Sciences}, volume = {13}, number = {1}, year = {1979}, mrnumber = {525457}, zbl = {0402.03041}, language = {en}, url = {http://archive.numdam.org/item/ITA_1979__13_1_49_0/} }
TY - JOUR AU - Fachini, E. AU - Maggiolo-Schettini, A. TI - A hierarchy of primitive recursive sequence functions JO - RAIRO. Informatique théorique PY - 1979 SP - 49 EP - 67 VL - 13 IS - 1 PB - EDP-Sciences UR - http://archive.numdam.org/item/ITA_1979__13_1_49_0/ LA - en ID - ITA_1979__13_1_49_0 ER -
Fachini, E.; Maggiolo-Schettini, A. A hierarchy of primitive recursive sequence functions. RAIRO. Informatique théorique, Volume 13 (1979) no. 1, pp. 49-67. http://archive.numdam.org/item/ITA_1979__13_1_49_0/
1. Complessità di calcolo delle funzioni, Boringhieri, Torino, 1975.
,2. Iteration of Primitive Recursion, Zeisch. f. math. Logik und Grundl. d. Math., Vol. 9, 1965, pp. 253-255. | MR | Zbl
,3. Zur Entscheidbarkeit der funktionalen Aquivalenz, Automata Theory and Formal Languages 2nd GI Conference, Lecture Notes in Computer Science, Vol. 33, 1975, pp. 127-133. | MR | Zbl
,4. A Hierarchy of Primitive Recursive Functions, Zeitsch. f. math. Logik und Grundl. d. Math., Vol. 9, 1963, pp. 331-345. | MR | Zbl
,5. 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. | MR | Zbl
,6. Iteration and Recursion, Proc. Nat.Acad. Sci.U.S.A., Vol. 61, 1968pp. 378-379. | MR | Zbl
and ,7. Recursiveness, Academic Press, New York, 1970. | MR | Zbl
and ,8. Quelques caractérisations des fonctions récursives partielles, C. R. Acad. Sc. Paris, t. 276, série A, 1973, pp. 1325-1327. | MR | Zbl
and ,9. Sequence-to-Sequence Recursiveness, Information Processing Lett., Vol. 4, 1975, pp. 1-6. | MR | Zbl
and ,10. Proving a Compiler Correct: a Simple Approach, J. Comput. System Sc,. Vol. 10, 1975, pp. 370-383. | MR | Zbl
and ,11. Some Classes of Recursive Functions, Rozprawy Mathematyczne, Vol. 4, 1953, pp.1-45. | MR | Zbl
,12. 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. | MR | Zbl
and ,13. The Complexity of LOOP Programs, Proc. 22nd A.C.M. Nat: Conference, Washington, D.C., 1968, pp. 465-469.
and ,14. Characterization of the Elementary Functions in Terms of Nesting of Primitive Recursions, Recursive Function Theory Newsletters, Vol. 5, 1973.
,15. Classes of Recursive Functions Based on Ackermann's Function, Pacific J. Math., Vol. 15, 1965, pp. 1027-1044. | MR | Zbl
,16. Rekursionszahlen und die Grzegorczyk Hierarchie, Arch. Math. Logik Grundlagenforsch., Vol. 12, 1969, pp. 85-97. | MR | Zbl
,17. A note on Comparison of Subrecursive Hiérarchies, Information Processing Lett., Vol. 1, 1971, pp. 42-44. | MR | Zbl
,18. The Equivalence Problem of Simple Programs, J. Ass. Comput. Mach, Vol. 17, 1970, pp. 729-738. | MR | Zbl
,