Author:
Beigel Richard,Buhrman Harry,Fejer Peter,Fortnow Lance,Grabowski Piotr,Longpré Luc,Muchnik Andrej,Stephan Frank,Torenvliet Leen
Abstract
AbstractA recursive enumerator for a function h is an algorithm f which enumerates for an input x finitely many elements including h(x). f is a k(n)-enumerator if for every input x of length n. h(x) is among the first k(n) elements enumerated by f. If there is a k(n)-enumerator for h then h is called k(n)-enumerable. We also consider enumerators which are only A-recursive for some oracle A.
Publisher
Cambridge University Press (CUP)
Reference33 articles.
1. Three approaches for defining the concept of information quantity;Kolmogorov;Problems of Information Transmission,1965
2. A formal theory of inductive inference. Part II
3. On the Length of Programs for Computing Finite Binary Sequences
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献