Result: The Kolmogorov complexity of infinite words
Title:
The Kolmogorov complexity of infinite words
Authors:
Source:
Complexity of algorithms and computationsTheoretical computer science. 383(2-3):187-199
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 40 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Analyse mathématique, Mathematical analysis, Mesure et intégration, Measure and integration, 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, Logiciel, Software, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Gestion des mémoires et des fichiers (y compris la protection et la sécurité des fichiers), Memory and file management (including protection and security), Boîte, Box, Caja, Comptage, Counting, Contaje, Dimension Hausdorff, Hausdorff dimension, Dimensión Hausdorff, Enquête, Survey, Encuesta, Entropie, Entropy, Entropía, Fractal, Fractale, Fractals, Garnissage, Packing, Relleno, Informatique théorique, Computer theory, Informática teórica, Mesure information, Information measure, Medida información, Mot infini, Infinite word, Palabra infinita, Théorie information, Information theory, Teoría información, 05B40, 28A80, 68P30, 68Q30, Complexité Kolmogorov, Kolmogorov complexity, Dimension garnissage, Packing dimension, Géométrie fractale, Théorie dimension, Dimension theory, Box-counting dimensions, Entropy of languages, Subword complexity, ω-languages
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Martin-Luther-Universität Halle-Wittenberg, Institut für Informatik, von-Seckendorff-Platz 1, 06099 Halle, Saale, Germany
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
Mathematics
Mathematics
Accession Number:
edscal.19061045
Database:
PASCAL Archive
Further Information
We present a brief survey of results on relations between the Kolmogorov complexity of infinite strings and several measures of information content (dimensions) known from dimension theory, information theory or fractal geometry. Special emphasis is placed on bounds on the complexity of strings in constructively given subsets of the Cantor space. Finally, we compare the Kolmogorov complexity to the subword complexity of infinite strings.