Author:
Case John,Chen Keh-Jiann,Jain Sanjay,Merkle Wolfgang,Royer James S.
Reference32 articles.
1. J.A. Bārzdiņš, Two theorems on the limiting synthesis of functions, in: Theory of Algorithms and Programs, Latvian State University, Riga, U.S.S.R 210, 1974, pp. 82–88
2. Quantum complexity theory;Bernstein;SIAM Journal of Computing,1997
3. A machine independent theory of the complexity of recursive functions;Blum;Journal of the ACM,1967
4. Toward a mathematical theory of inductive inference;Blum;Information and Control,1975
5. Costs of general purpose learning;Case;Theoretical Computer Science,2001
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献