Descriptive complexity of computable sequences

被引：1
|
作者：
Durand, B
Shen, A
Vereshchagin, N
机构：
[1] Univ Aix Marseille 1, CMI, LIM, F-13453 Marseille 13, France
[2] Russian Acad Sci, Inst Problems Informat Transmiss, Moscow, Russia
[3] Moscow MV Lomonosov State Univ, Dept Math Log & Theory Algorithms, Moscow 119899, Russia
来源：
THEORETICAL COMPUTER SCIENCE | 2002年 / 271卷 / 1-2期
关键词：
Computational complexity - Game theory - Recursive functions - Set theory;
D O I：
10.1016/S0304-3975(01)00030-5
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Our goal is to study the complexity of infinite binary recursive sequences. We introduce several measures of the quantity of information they contain. Some measures are based on size of programs that generate the sequence, the others are based on the Kolmogorov complexity of its finite prefixes. The relations between these complexity measures are established. The most surprising among them are obtained using a specific two-players game(2). (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：47 / 58
页数：12
相关论文
共 50 条
12345