Author:
Barmpalias George,Zhang Xiaoyan,Zhan Bohua
Reference15 articles.
1. Universal computably enumerable sets and initial segment prefix-free complexity;G Barmpalias;Inf. Comput,2013
2. The ibT degrees of computably enumerable sets are not dense;G Barmpalias;Ann. Pure Appl. Logic,2006
3. Kolmogorov complexity and computably enumerable sets;G Barmpalias;Ann. Pure Appl. Logic,2013
4. Analogues of Chaitin's Omega in the computably enumerable sets;G Barmpalias;Inf. Process. Lett,2013
5. Complexity of programs to determine whether natural numbers not greater than n belong to a recursively enumerable set;J Barzdins;Soviet Mathematics Doklady,1968