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 条
  • [41] ON THE RELATIONSHIP BETWEEN THE COMPLEXITY, THE DEGREE, AND THE EXTENSION OF A COMPUTABLE SET
    MAASS, W
    SLAMAN, TA
    LECTURE NOTES IN MATHEMATICS, 1990, 1432 : 297 - 322
  • [42] A computable version of the random signs problem and Kolmogorov complexity
    Dai, JJ
    STATISTICS & PROBABILITY LETTERS, 2004, 67 (01) : 27 - 31
  • [43] Borel Complexity of Topological Operations on Computable Metric Spaces
    Brattka, Vasco
    Gherardi, Guido
    JOURNAL OF LOGIC AND COMPUTATION, 2009, 19 (01) : 45 - 76
  • [44] The descriptive complexity approach to LOGCFL
    Lautemann, C
    McKenzie, P
    Schwentick, T
    Vollmer, H
    STACS'99 - 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1999, 1563 : 444 - 454
  • [45] The Descriptive Complexity of Parity Games
    Dawar, Anuj
    Graedel, Erich
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2008, 5213 : 354 - +
  • [46] Descriptive complexity of controllable graphs
    Abiad, Aida
    Dawar, Anuj
    Zapata, Octavio
    Procedia Computer Science, 2023, 223 : 20 - 27
  • [47] Descriptive complexity and model checking
    Immerman, N
    FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 1998, 1530 : 1 - 5
  • [48] On the descriptive complexity of homogeneous continua
    Krupski, Pawel
    TOPOLOGY AND ITS APPLICATIONS, 2021, 304
  • [49] On the descriptive complexity of Salem sets
    Marcone, Alberto
    Valenti, Manlio
    FUNDAMENTA MATHEMATICAE, 2022, 257 (01) : 69 - 94
  • [50] The descriptive complexity approach to LOGCFL
    Lautemann, C
    McKenzie, P
    Schwentick, T
    Vollmer, H
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 62 (04) : 629 - 652
12345