Result: Non-reducible descriptions for conditional Kolmogorov complexity
Title:
Non-reducible descriptions for conditional Kolmogorov complexity
Source:
Theory and applications of models of computationTheoretical computer science. 384(1):77-86
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 4 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Divers, Miscellaneous, Addition, Adicción, Approche probabiliste, Probabilistic approach, Enfoque probabilista, Construction, Construcción, Entrée ordinateur, Input, Entrada ordenador, Entrée sortie, Input output, Entrada salida, Informatique théorique, Computer theory, Informática teórica, 68Q30, Complexité Kolmogorov, Kolmogorov complexity, Conditional Kolmogorov complexity, Conditional descriptions
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Institute of New Technologies, Russian Federation
LIF CNRS, CMI, 39 rue Joliot-Curie, 13453 Marseille, France
Moscow State University, Russian Federation
LIF CNRS, CMI, 39 rue Joliot-Curie, 13453 Marseille, France
Moscow State University, Russian Federation
ISSN:
0304-3975
Rights:
Copyright 2008 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19069681
Database:
PASCAL Archive
Further Information
Assume that a program p on input a outputs b. We are looking for a shorter program q having the same property (q(a) = b). In addition, we want q to be simple conditional to p (this means that the conditional Kolmogorov complexity K(q\p) is negligible). In the present paper, we prove that sometimes there is no such program q, even in the case when the complexity of p is much bigger than K(b\a). We give three different constructions that use the game approach, probabilistic arguments and algebraic arguments, respectively.