中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
机构
采集方式
内容类型
发表日期
学科主题
筛选

浏览/检索结果: 共7条,第1-7条 帮助

条数/页: 排序方式:
The typical Turing degree 期刊论文  OAI收割
PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 2014, 卷号: 109, 页码: 1-39
Barmpalias, George; Day, Adam R.; Lewis-Pye, Andy E. M.
  |  收藏  |  浏览/下载:26/0  |  提交时间:2014/12/16
On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity 期刊论文  OAI收割
THEORY OF COMPUTING SYSTEMS, 2013, 卷号: 52, 期号: 1, 页码: 28-47
Baartse, Martijn; Barmpalias, George
  |  收藏  |  浏览/下载:24/0  |  提交时间:2014/12/16
Kolmogorov complexity and computably enumerable sets 期刊论文  OAI收割
ANNALS OF PURE AND APPLIED LOGIC, 2013, 卷号: 164, 期号: 12, 页码: 1187-1200
Barmpalias, George; Li, Angsheng
  |  收藏  |  浏览/下载:15/0  |  提交时间:2014/12/16
ALGORITHMIC RANDOMNESS AND MEASURES OF COMPLEXITY 期刊论文  OAI收割
BULLETIN OF SYMBOLIC LOGIC, 2013, 卷号: 19, 期号: 3, 页码: 318-350
Barmpalias, George
  |  收藏  |  浏览/下载:18/0  |  提交时间:2014/12/16
Universal computably enumerable sets and initial segment prefix-free complexity 期刊论文  OAI收割
INFORMATION AND COMPUTATION, 2013, 卷号: 233, 页码: 41-59
Barmpalias, George
  |  收藏  |  浏览/下载:18/0  |  提交时间:2014/12/16
universality probability of a prefix-free machine 期刊论文  OAI收割
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2012, 卷号: 370, 期号: 1971, 页码: 3488-3511
Barmpalias George; Dowe David L.
  |  收藏  |  浏览/下载:18/0  |  提交时间:2013/09/17
on the number of infinite sequences with trivial initial segment complexity 期刊论文  OAI收割
Theoretical Computer Science, 2011, 卷号: 412, 期号: 52, 页码: 7133-7146
George Barmpalias; T.F. Sterkenburg
  |  收藏  |  浏览/下载:25/0  |  提交时间:2013/10/08