Author:
Freivalds Rūsiņš,Zeugmann Thomas,Pogosyan Grant R.
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Lecture Notes in Computer Science;F.M. Ablaev,1986
2. Austinat, H., Diekert, V., Hertrampf, U., Petersen, H.: Regular frequency computations. Theoretical Computer Science 330(1), 15–21 (2005)
3. Beigel, R., Gasarch, W., Kinber, E.: Frequency computation and bounded queries. Theoretical Computer Science 163(1-2), 177–192 (1996)
4. Case, J., Kaufmann, S., Kinber, E.B., Kummer, M.: Learning recursive functions from approximations. J. Comput. Syst. Sci. 55(1), 183–196 (1997)
5. Degtev, A.N.: On (m,n)-computable sets. In: Moldavanskij, D.I. (ed.) Algebraic Systems, pp. 88–99. Ivanovo Gos. Universitet (1981) (in Russian)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algorithmic Information Theory and Computational Complexity;Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence;2013