To the top

Page Manager: Webmaster
Last update: 9/11/2012 3:13 PM

Tell a friend about this page
Print version

Bounded Kolmogorov Comple… - University of Gothenburg, Sweden Till startsida
To content Read more about how we use cookies on

Bounded Kolmogorov Complexity Based on Cognitive Models

Journal article
Authors Claes Strannegård
Abdul Rahim Nizamani
Sjöberg Anders
Fredrik Engström
Published in Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
Volume 7999
Pages 130-139
ISSN 1867-8211
Publication year 2013
Published at Department of Applied Information Technology (GU)
Department of Philosophy, Linguistics and Theory of Science
Pages 130-139
Language en
Keywords artificial general intelligence, cognitive model, Kolmogorov complexity, pattern discovery.
Subject categories Logic


Computable versions of Kolmogorov complexity have been used in the context of pattern discovery [1]. However, these complexity measures do not take the psychological dimension of pattern discovery into account. We propose a method for pattern discovery based on a version of Kolmogorov complexity where computations are restricted to a cognitive model with limited computational resources. The potential of this method is illustrated by implementing it in a system used to solve number sequence problems. The system was tested on the number sequence problems of the IST IQ test [2], and it scored 28 out of 38 problems, above average human performance, whereas the mathematical software packages Maple, Mathematica, and WolframAlpha scored 9, 9, and 12, respectively. The results obtained and the generalizability of the method suggest that this version of Kolmogorov complexity is a useful tool for pattern discovery in the context of AGI.

Page Manager: Webmaster|Last update: 9/11/2012

The University of Gothenburg uses cookies to provide you with the best possible user experience. By continuing on this website, you approve of our use of cookies.  What are cookies?