Time-bounded incompressibility of compressible strings and sequences
Information Processing Letters
Volume and Entropy of Regular Timed Languages: Discretization Approach
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
An Accuracy Metric: Percentages, Randomness, and Probabilities
Journal of Data and Information Quality (JDIQ)
Wikispeedia: an online game for inferring semantic distances between concepts
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Approximation of the two-part MDL code
IEEE Transactions on Information Theory
Knitting for fun: a recursive sweater
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Information distance and applications
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Information measures for infinite sequences
Theoretical Computer Science
Methods to tackle state explosion problem in model checking
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
NPAR '10 Proceedings of the 8th International Symposium on Non-Photorealistic Animation and Rendering
The communication complexity of correlation
IEEE Transactions on Information Theory
Stability of properties of Kolmogorov complexity under relativization
Problems of Information Transmission
Information distance based fitness and diversity metrics
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Can Machines Think? An Old Question Reformulated
Minds and Machines
Rate distortion and denoising of individual data using Kolmogorov complexity
IEEE Transactions on Information Theory
Measuring universal intelligence: Towards an anytime intelligence test
Artificial Intelligence
Measuring the non-compositionality of multiword expressions
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Lower bounds for reducibility to the Kolmogorov random strings
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Trajectory based behavior analysis for user verification
IDEAL'10 Proceedings of the 11th international conference on Intelligent data engineering and automated learning
Counting dependent and independent strings
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Impossibility of independence amplification in Kolmogorov complexity theory
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Using grammar induction to model adaptive behavior of networks of collaborative agents
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
A Fast Quartet tree heuristic for hierarchical clustering
Pattern Recognition
A divergence formula for randomness and dimension
Theoretical Computer Science
Optimality issues of universal greedy agents with static priors
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Regular patterns, regular languages and context-free languages
Information Processing Letters
Representation of hypertext documents based on terms, links and text compressibility
ICONIP'10 Proceedings of the 17th international conference on Neural information processing: theory and algorithms - Volume Part I
Index sets and universal numberings
Journal of Computer and System Sciences
Nonapproximability of the normalized information distance
Journal of Computer and System Sciences
A bounded distance metric for comparing tree structure
Information Systems
Kolmogorov complexity and combinatorial methods in communication complexity
Theoretical Computer Science
Searching a pattern in compressed DNA sequences
International Journal of Bioinformatics Research and Applications
An extended proof-carrying code framework for security enforcement
Transactions on computational science XI
A new multiword expression metric and its applications
Journal of Computer Science and Technology - Special issue on natural language processing
Self-organizing map representation for clustering wikipedia search results
ACIIDS'11 Proceedings of the Third international conference on Intelligent information and database systems - Volume Part II
Studying software evolution using artefacts' shared information content
Science of Computer Programming
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
A Monte-Carlo AIXI approximation
Journal of Artificial Intelligence Research
The equivalence of sampling and searching
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Kolmogorov complexity as a language
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Measuring multi-language software evolution: a case study
Proceedings of the 12th International Workshop on Principles of Software Evolution and the 7th annual ERCIM Workshop on Software Evolution
Limits on the computational power of random strings
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Self-modification and mortality in artificial agents
AGI'11 Proceedings of the 4th international conference on Artificial general intelligence
An information theoretic representation of agent dynamics as set intersections
AGI'11 Proceedings of the 4th international conference on Artificial general intelligence
Comparing humans and AI agents
AGI'11 Proceedings of the 4th international conference on Artificial general intelligence
A kolmogorov complexity proof of the lovász local lemma for satisfiability
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Information distance and its extensions
DS'11 Proceedings of the 14th international conference on Discovery science
Universal prediction of selected bits
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Universal knowledge-seeking agents
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Evaluating a reinforcement learning algorithm with a general intelligence test
CAEPIA'11 Proceedings of the 14th international conference on Advances in artificial intelligence: spanish association for artificial intelligence
Functional programs as compressed data
PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
Automatic upright orientation and good view recognition for 3D man-made models
Pattern Recognition
Evaluation of analogical proportions through Kolmogorov complexity
Knowledge-Based Systems
Clustering the normalized compression distance for influenza virus data
Algorithms and Applications
MICAI'11 Proceedings of the 10th international conference on Artificial Intelligence: advances in Soft Computing - Volume Part II
Tradeoffs in targeted fuzzing of cyber systems by defenders and attackers
Proceedings of the Seventh Annual Workshop on Cyber Security and Information Intelligence Research
Biological networks: comparison, conservation, and evolutionary trees
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
Symmetry of information: a closer look
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Arithmetic complexity via effective names for random sequences
ACM Transactions on Computational Logic (TOCL)
Unsupervised grammar inference using the minimum description length principle
MLDM'12 Proceedings of the 8th international conference on Machine Learning and Data Mining in Pattern Recognition
Complexity of complexity and maximal plain versus prefix-free kolmogorov complexity
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A reversible abstract machine and its space overhead
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Curiouser and curiouser: the link between incompressibility and complexity
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Making solomonoff induction effective: or: you can learn what you can bound
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Reductions to the set of random strings: the resource-bounded case
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Automatic learning of subclasses of pattern languages
Information and Computation
A Kolmogorov complexity proof of the Lovász Local Lemma for satisfiability
Theoretical Computer Science
A bayesian approach for classification rule mining in quantitative databases
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
Predictive complexity and generalized entropy rate of stationary ergodic processes
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Limits on the computational power of random strings
Information and Computation
Expert Systems with Applications: An International Journal
Mathematical Structures in Computer Science
Asymptotic non-learnability of universal agents with computable horizon functions
Theoretical Computer Science
On measuring social intelligence: experiments on competition and cooperation
AGI'12 Proceedings of the 5th international conference on Artificial General Intelligence
Memory issues of intelligent agents
AGI'12 Proceedings of the 5th international conference on Artificial General Intelligence
Generating corpora of activities of daily living and towards measuring the corpora's complexity
CAVE'12 Proceedings of the First international conference on Cognitive Agents for Virtual Environments
Malicious URL Detection Based on Kolmogorov Complexity Estimation
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
Information distance between what I said and what it heard
Communications of the ACM
On Potential Cognitive Abilities in the Machine Kingdom
Minds and Machines
Conditional Kolmogorov complexity and universal probability
Theoretical Computer Science
Bounded kolmogorov complexity based on cognitive models
AGI'13 Proceedings of the 6th international conference on Artificial General Intelligence
Curiosity: From psychology to computation
ACM Computing Surveys (CSUR)
Succinct encoding of arbitrary graphs
Theoretical Computer Science
Universal knowledge-seeking agents
Theoretical Computer Science
Initial segment complexities of randomness notions
Information and Computation
A Revised Attack on Computational Ontology
Minds and Machines
CID: an efficient complexity-invariant distance for time series
Data Mining and Knowledge Discovery
Automatic learners with feedback queries
Journal of Computer and System Sciences
Hi-index | 0.21 |
The book is outstanding and admirable in many respects. ... is necessary reading for all kinds of readers from undergraduate students to top authorities in the field. Journal of Symbolic Logic Written by two experts in the field, this is the only comprehensive and unified treatment of the central ideas and their applications of Kolmogorov complexity. The book presents a thorough treatment of the subject with a wide range of illustrative applications. Such applications include the randomness of finite objects or infinite sequences, Martin-Loef tests for randomness, information theory, computational learning theory, the complexity of algorithms, and the thermodynamics of computing. It will be ideal for advanced undergraduate students, graduate students, and researchers in computer science, mathematics, cognitive sciences, philosophy, artificial intelligence, statistics, and physics. The book is self-contained in that it contains the basic requirements from mathematics and computer science. Included are also numerous problem sets, comments, source references, and hints to solutions of problems. New topics in this edition include Omega numbers, KolmogorovLoveland randomness, universal learning, communication complexity, Kolmogorov's random graphs, time-limited universal distribution, Shannon information and others.