Subject
General Computer Science,Theoretical Computer Science
Reference30 articles.
1. Complexity of programs to determine whether natural numbers not greater than n belong to a recursively enumerable set;Barzdin;Soviet Math. Dokl.,1968
2. A Survey of Results in Grammatical Inference;Bierman,1972
3. A machine independent theory of the complexity of recursive functions;Blum;J. ACM,1967
4. Toward a mathematical theory of inductive inference;Blum;Information and Control,1975
5. On the length of programs for computing finite binary sequences;Chaitin;J. ACM,1966
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献