Kolmogorov complexity and non-determinism

被引：0
|
作者：
Grigorieff, S
Marion, JY
机构：
[1] Univ Paris 07, UFR Informat, F-75251 Paris 05, France
[2] Univ Clermont Ferrand, Lab LLAIC, Clermont Ferrand, France
[3] Univ Nancy 2, LORIA, Calligramme Project, F-54506 Vandoeuvre Les Nancy, France
来源：
THEORETICAL COMPUTER SCIENCE | 2002年 / 271卷 / 1-2期
关键词：
Kolmogorov complexity;
D O I：
10.1016/S0304-3975(01)00038-X
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We are concerned with Kolmogorov complexity of strings produced by non-deterministic algorithms. For this, we consider five classes of non-deterministic description modes: (i) non-bounded description modes in which the number of outputs depends on programs, (ii) distributed description modes in which the number of outputs depends on the size of the outputs, (iii) spread description modes in which the number of outputs depends on both programs and the size of the outputs., (iv) description modes for which each string has a unique minimal description, and lastly (v) description modes for which the set of minimal length descriptions is a prefix set. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：151 / 180
页数：30
相关论文
共 50 条
  • [21] Programming with non-determinism in deductive databases
    Fosca Giannotti
    Sergio Greco
    Domenico Saccà
    Carlo Zaniolo
    Annals of Mathematics and Artificial Intelligence, 1997, 19 : 97 - 125
  • [22] A Testbed of Non-determinism in Educational Context
    Loukantchevsky, Milen
    Kostadinov, Nikolay
    Avakyan, Hovanes
    COMPUTER SYSTEMS AND TECHNOLOGIES, 2019, : 304 - 307
  • [23] Countable non-determinism and uncountable limits
    DiGianantonio, P
    Honsell, F
    Liani, S
    Plotkin, GD
    CONCUR '94: CONCURRENCY THEORY, 1994, 836 : 130 - 145
  • [24] A POWER-DOMAIN FOR COUNTABLE NON-DETERMINISM
    PLOTKIN, GD
    LECTURE NOTES IN COMPUTER SCIENCE, 1982, 140 : 418 - 428
  • [25] Why should they believe us?: Determinism, non-determinism and evidence
    Budgen, David
    19TH CONFERENCE ON SOFTWARE ENGINEERING EDUCATION & TRAINING, PROCEEDINGS, 2006, : 4 - 4
  • [26] A unified view of monadic and applicative non-determinism
    Rivas, Exequiel
    Jaskelioff, Mauro
    Schrijvers, Tom
    SCIENCE OF COMPUTER PROGRAMMING, 2018, 152 : 70 - 98
  • [27] Non-Determinism and the Lawlessness of Machine Learning Code
    Cooper, A. Feder
    Frankle, Jonathan
    De Sa, Christopher
    PROCEEDINGS OF THE 2022 SYMPOSIUM ON COMPUTER SCIENCE AND LAW, CSLAW 2022, 2022, : 1 - 8
  • [28] Semantic Domains for Combining Probability and Non-Determinism
    Tix, Regina
    Keimel, Klaus
    Plotkin, Gordon
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, 222 : 3 - 97
  • [29] Non-determinism in Godel's System T
    Kristiansen, Lars
    Mender, Bedeho Mesghina Wolde
    THEORY OF COMPUTING SYSTEMS, 2012, 51 (01) : 85 - 105
  • [30] A coalgebraic approach to non-determinism: Applications to multilattices
    Cabrera, I. P.
    Cordero, P.
    Gutierrez, G.
    Martinez, J.
    Ojeda-Aciego, M.
    INFORMATION SCIENCES, 2010, 180 (22) : 4323 - 4335
12345