Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Ackermann, W.: Zum Hilbertschen Aufbau der reellen Zahlen. Math. annalen 99, 118–133 (1928)
2. Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the poly-time functions. Computational Complexity 2, 97–110 (1992)
3. Bellantoni, S., Niggl, K.-H.: Ranking primitive recursions: The low Grzegorczyk classes revisited. SIAM Journal on Computing 29(2), 401–415 (1999)
4. Caporaso, S., Covino, E., Pani, G.: A predicative approach to the classification problem. J. Funct. Program. 11(1), 95–116 (2001)
5. Cobham, A.: The intrinsic computational difficulty of functions. In: Bar-Hillel, Y. (ed.) Proceedings of the International Conference on Logic, Methodology, and Philosophy of Science, pp. 24–30. North-Holland, Amsterdam (1962)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献