Author:
Freivalds Rūsiņš,Zeugmann Thomas
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Adleman, L.M., Blum, M.: Inductive inference and unsolvability. The Journal of Symbolic Logic 56(3), 891–900 (1991)
2. Bārzdiņš, J.M.: Complexity of programs to determine whether natural numbers not greater than n belong to a recursively enumerable set. Soviet Mathematics Doklady 9, 1251–1254 (1968)
3. Blum, M.: A machine independent theory of the complexity of recursive functions. Journal of the ACM 14(2), 322–336 (1967)
4. Case, J., Smith, C.: Comparison of identification criteria for machine inductive inference. Theoretical Computer Science 25(2), 193–220 (1983)
5. Cholak, P., Downey, R., Fortnow, L., Gasarch, W., Kinber, E., Kummer, M., Kurtz, S., Slaman, T.A.: Degrees of inferability. In: Proc. 5th Annual ACM Workshop on Computational Learning Theory, pp. 180–192. ACM Press, New York (1992)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献