Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Bienvenu, L., Downey, R.: Kolmogorov Complexity and Solovay Functions. In: Symposium on Theoretical Aspects of Computer Science, Freiburg, pp. 147–158 (2009)
2. Blum, M.: A machine-independent theory of the complexity of recursive functions. Journal of the ACM 14(2), 322–336 (1967)
3. Blum, M.: On the size of machines. Information and Control 11, 257–265 (1967)
4. Burgin, M.: Generalized Kolmogorov complexity and other dual complexity measures. Translated from Kibernetica 4, 21–29 (1990); Original article submitted June 19 (1986)
5. Burgin, M.: Algorithmic complexity of recursive and inductive algorithms. Theoretical Computer Science 317, 31–60 (2004)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Blum Static Complexity and Encoding Spaces;Descriptional Complexity of Formal Systems;2013