Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Blum, M.: A machine-independent theory of the complexity of recursive functions. Journal of the ACM 14(2), 322–336 (1967)
2. Blum, M.: On the size of machines. Information and Control 11, 257–265 (1967)
3. Lecture Notes in Operations Research and Mathematical Systems;C. Boucher,1971
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)