Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. V. Bennison, On the computational complexity of recursively enumerable sets, Ph.D. Dissertation, University of Chicago, 1976.
2. ___________, Recursively enumerable complexity sequences and measure independence, preprint to appear.
3. V. Bennison and R.I. Soare, Some lowness properties and computational complexity sequences, J. Theoretical Computer Science 6 (1978) 233–254.
4. M. Blum, A machine-independent theory of the complexity of recursive functions, J. Assoc. for Computing Machinery 14 (1967), 322–336.
5. _______, On defining the complexity of partial recursive functions, preprint.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献