中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR

Search Results

Help

Item hits: (Results 1-5 of 5)

Items/Page:    Sort:
Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega [期刊论文]
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2016-01-01, 卷号: 82, 期号: 8, 页码: 1283-1299
Barmpalias, G; Fang, N; Lewis-Pye, A
  |  
 
Universal computably enumerable sets and initial segment prefix-free complexity [期刊论文]
INFORMATION AND COMPUTATION, 2013-01-01, 卷号: 233, 页码: 41-59
Barmpalias, George

 
Kolmogorov complexity and computably enumerable sets [期刊论文]
ANNALS OF PURE AND APPLIED LOGIC, 2013-01-01, 卷号: 164, 期号: 12, 页码: 1187-1200
Barmpalias, George; Li, Angsheng

 
On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity [期刊论文]
THEORY OF COMPUTING SYSTEMS, 2013-01-01, 卷号: 52, 期号: 1, 页码: 28-47
Baartse, Martijn; Barmpalias, George

 
on the number of infinite sequences with trivial initial segment complexity [期刊论文]
Theoretical Computer Science, 2011-01-01, 卷号: 412, 期号: 52, 页码: 7133-7146
George Barmpalias; T.F. Sterkenburg

 

1

 

Valid XHTML 1.0!
Copyright © 2007-2022  中国科学院软件研究所 - Feedback
Powered by CSpace