Article
A Classification of the Recursive Functions
Citing Literature
Number of times cited: 21
- Paul Shafer, Honest elementary degrees and degrees of relative provability without the cupping property, Annals of Pure and Applied Logic, 168, 5, (1017), (2017).
- Lars Kristiansen, On subrecursive representability of irrational numbers, Computability, 6, 3, (249), (2017).
- Lars Kristiansen, Jan-Christoph Schlage-Puchta and Andreas Weiermann, Streamlined subrecursive degree theory, Annals of Pure and Applied Logic, 163, 6, (698), (2012).
- Rod Downey, William Gasarch and Michael Moses, The structure of the honest polynomial m-degrees, Annals of Pure and Applied Logic, 70, 2, (113), (1994).
- Luc Longpré and Paul Young, Cook reducibility is faster than Karp reducibility in NP, Journal of Computer and System Sciences, 41, 3, (389), (1990). [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference Eugene, OR, USA 19-22 June 1989 [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference IEEE Comput. Soc. Press , (1989). 0-8186-1958-9 R. Downey, S. Homer, W.I. Gasarch and M. Moses On honest polynomial reductions, relativizations, and P=NP 196 207 , 10.1109/SCT.1989.41825 http://ieeexplore.ieee.org/document/41825/
- , Bibliography, Theories of Computational Complexity, 10.1016/S0167-5060(08)70415-1, (453-468), (1988).
- S. S. Marchenkov and V. L. Matrosov, Complexity of algorithms and computations, Journal of Soviet Mathematics, 15, 2, (140), (1981).
- Ren-ji Tao, On the computational power of automata with time or space bounded by Ackermann's or superexponential functions, Theoretical Computer Science, 16, 2, (115), (1981).
- R. Verbeek and K. Weihrauch, Data representation and computational complexity, Theoretical Computer Science, 7, 1, (99), (1978).
- Albert R. Meyer and Michael Ian Shamos, Time and Space††This research was supported in part under N S F grant GJ 43634X, contract number DCR 7412997 A01., Perspectives on Computer Science, 10.1016/B978-0-12-389450-2.50014-1, (125-146), (1977).
- Donald A. Alton, Nonexistence of program optimizers in several abstract settings, Journal of Computer and System Sciences, 12, 3, (368), (1976).
- F.D. Lewis, On computational reducibility, Journal of Computer and System Sciences, 12, 1, (122), (1976).
- Kurt Mehlhorn, Polynomial and abstract subrecursive classes, Journal of Computer and System Sciences, 12, 2, (147), (1976).
- Steven S. Muchnick, Computational Complexity of Multiple Recursive Schemata, SIAM Journal on Computing, 5, 3, (427), (1976).
- Michael Machtey, On the density of honest subrecursive classes, Journal of Computer and System Sciences, 10, 2, (183), (1975).
- F. W. v. Henke, G. Rose, K. Indermark and K. Weihrauch, On primitive recursive wordfunctions, Computing, 15, 3, (217), (1975).
- Michael MacHtey, Helping and the meet of pairs of honest subrecursive classes, Information and Control, 28, 1, (76), (1975).
- Michael Machtey, The honest subrecursive classes are a lattice, Information and Control, 24, 3, (247), (1974). Automata Theory USA 14th Annual Symposium on Switching and Automata Theory (swat 1973) IEEE , (1973). Kurt Mehlhorn On the size of sets of computable functions , (1973). 190 196 4569743 , 10.1109/SWAT.1973.23 http://ieeexplore.ieee.org/document/4569743/ Automata Theory USA 14th Annual Symposium on Switching and Automata Theory (swat 1973) IEEE , (1973). Michael Machtey A notion of helping and pseudo-complementation in lattices of honest subrecursive classes , (1973). 181 189 4569742 , 10.1109/SWAT.1973.1 http://ieeexplore.ieee.org/document/4569742/
