A computable version of the random signs problem and Kolmogorov complexity

被引：3
|
作者：
Dai, JJ [1 ]
机构：
[1] Peking Univ, Sch Math Sci, Beijing 100871, Peoples R China
来源：
STATISTICS & PROBABILITY LETTERS | 2004年 / 67卷 / 01期
关键词：
Kolmogorov complexity theory; the random signs problem;
D O I：
10.1016/j.spl.2003.12.002
中图分类号：
O21 [概率论与数理统计]; C8 [统计学];
学科分类号：
020208 ; 070103 ; 0714 ;
摘要：
An effective solution to a computable version of the random signs problem is formulated using a coefficient from Kolmogorov complexity theory. (C) 2003 Published by Elsevier B.V.
引用
收藏
页码：27 / 31
页数：5
相关论文
共 50 条
  • [21] ON GENERALIZED KOLMOGOROV COMPLEXITY
    BALCAZAR, JL
    BOOK, RV
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 210 : 334 - 340
  • [22] KOLMOGOROV AND THE COMPLEXITY OF ALGORITHMS
    RAZBOROV, AA
    BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 1990, 22 : 79 - 82
  • [23] Kolmogorov complexity and noncomputability
    Davie, G
    MATHEMATICAL LOGIC QUARTERLY, 2002, 48 (04) : 574 - 580
  • [24] Approximating Kolmogorov complexity
    Ishkuvatov, Ruslan
    Musatov, Daniil
    Shen, Alexander
    COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE, 2023, 12 (03): : 283 - 297
  • [25] Kolmogorov Complexity Cores
    Souto, Andre
    PROGRAMS, PROOFS, PROCESSES, 2010, 6158 : 376 - 385
  • [26] Kolmogorov complexity of categories
    Department of Computer and Information Science, Brooklyn College, CUNY, Brooklyn, NY 11210, United States
    不详
    Lect. Notes Comput. Sci., 2013, (350-362):
  • [27] Kolmogorov complexity - Preface
    Semenov, A
    THEORETICAL COMPUTER SCIENCE, 1998, 207 (02) : 261 - 261
  • [28] Quantum Kolmogorov complexity
    Berthiaume, A
    van Dam, W
    Laplante, S
    15TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 240 - 249
  • [29] Quantum Kolmogorov complexity
    Berthiaume, A
    van Dam, W
    Laplante, S
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 63 (02) : 201 - 221
  • [30] Kolmogorov complexity with error
    Fortnow, L
    Lee, TR
    Vereshchagin, N
    STACS 2006, PROCEEDINGS, 2006, 3884 : 137 - 148
12345