Author:
Fachini E.,Maggiolo-Schettini A.
Reference18 articles.
1. 1. AUSIELLO G., Complessità di calcolo delle funzioni, Boringhieri, Torino, 1975.
2. 2. AXT P., Iteration of Primitive Recursion, Zeisch. f. math. Logik und Grundl. d. Math., Vol. 9, 1965, pp. 253-255.1957190144.00201
3. 3. BECK H., Zur Entscheidbarkeit der funktionalen Aquivalenz, Automata Theory and Formal Languages 2nd GI Conference, Lecture Notes in Computer Science, Vol. 33, 1975, pp. 127-133.4324360312.68049
4. 4. CLEAVE J. P., A Hierarchy of Primitive Recursive Functions, Zeitsch. f. math. Logik und Grundl. d. Math., Vol. 9, 1963, pp. 331-345.1597540124.00303
5. 5. COBHAM A., 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.2075610192.08702
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献