ALGORITHMIC RANDOMNESS AND MEASURES OF COMPLEXITY
文献类型：期刊论文
| 作者 | Barmpalias, George |
| 刊名 | BULLETIN OF SYMBOLIC LOGIC
 |
| 出版日期 | 2013 |
| 卷号 | 19期号:3页码:318-350 |
| ISSN号 | 1079-8986 |
| 中文摘要 | We survey recent advances on the interface between computability theory and algorithmic randomness, with special attention on measures of relative complexity. We focus on (weak) reducibilities that measure (a) the initial segment complexity of reals and (b) the power of reals to compress strings, when they are used as oracles. The results are put into context and several connections are made with various central issues in modern algorithmic randomness and computability. |
| 英文摘要 | We survey recent advances on the interface between computability theory and algorithmic randomness, with special attention on measures of relative complexity. We focus on (weak) reducibilities that measure (a) the initial segment complexity of reals and (b) the power of reals to compress strings, when they are used as oracles. The results are put into context and several connections are made with various central issues in modern algorithmic randomness and computability. |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS记录号 | WOS:000324845300002 |
| 公开日期 | 2014-12-16 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16914]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Barmpalias, George. ALGORITHMIC RANDOMNESS AND MEASURES OF COMPLEXITY[J]. BULLETIN OF SYMBOLIC LOGIC,2013,19(3):318-350. |
| APA | Barmpalias, George.(2013).ALGORITHMIC RANDOMNESS AND MEASURES OF COMPLEXITY.BULLETIN OF SYMBOLIC LOGIC,19(3),318-350. |
| MLA | Barmpalias, George."ALGORITHMIC RANDOMNESS AND MEASURES OF COMPLEXITY".BULLETIN OF SYMBOLIC LOGIC 19.3(2013):318-350. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。