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 条
  • [21] Complexity of categorical theories with computable models
    Goncharov, SS
    Khusainov, BK
    DOKLADY MATHEMATICS, 2002, 66 (01) : 52 - 54
  • [22] Complexity of categorical theories with computable models
    Goncharov S.S.
    Khoussainov B.
    Algebra and Logic, 2004, 43 (6) : 365 - 373
  • [23] Small Complexity Classes for Computable Analysis
    Kawamura, Akitoshi
    Ota, Hiroyuki
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE, PT II, 2014, 8635 : 432 - 444
  • [24] The Critical Exponent is Computable for Automatic Sequences
    Shallit, Jeffrey
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2011, (63): : 231 - 239
  • [25] THE CRITICAL EXPONENT IS COMPUTABLE FOR AUTOMATIC SEQUENCES
    Schaeffer, Luke
    Shallit, Jeffrey
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (08) : 1611 - 1626
  • [26] A zoo of computable binary normal sequences
    Pincus, Steve
    Singer, Burton H.
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2012, 109 (47) : 19145 - 19150
  • [27] Descriptive Complexity for Counting Complexity Classes
    Arenas, Marcelo
    Munoz, Martin
    Riveros, Cristian
    2017 32ND ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2017,
  • [28] DESCRIPTIVE COMPLEXITY FOR COUNTING COMPLEXITY CLASSES
    Arenas, Marcelo
    Munoz, Martin
    Riveros, Cristian
    LOGICAL METHODS IN COMPUTER SCIENCE, 2020, 16 (01)
  • [29] COMPUTABLE VS DESCRIPTIVE COMBINATORICS OF LOCAL PROBLEMS ON TREES
    Weilacher, Felix
    JOURNAL OF SYMBOLIC LOGIC, 2024, 89 (04) : 1835 - 1849
  • [30] Descriptive and parameterized complexity
    Grohe, M
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 1999, 1683 : 14 - 31
12345