CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Bounded Kolmogorov Complexity Based on Cognitive Models

Claes Strannegård (Institutionen för filosofi, lingvistik och vetenskapsteori ; Institutionen för tillämpad informationsteknologi (Chalmers)) ; Abdul Rahim Nizamani ; Sjöberg Anders ; Fredrik Engström
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (1867-8211). Vol. 7999 (2013), p. 130-139.
[Kapitel, refereegranskat]

Abstract. 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.

Nyckelord: artificial general intelligence, cognitive model, Kolmogorov complexity, pattern discovery.

Denna post skapades 2013-06-17. Senast ändrad 2013-09-03.
CPL Pubid: 178586


Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för filosofi, lingvistik och vetenskapsteori (GU)
Institutionen för tillämpad informationsteknologi (Chalmers)
Institutionen för tillämpad informationsteknologi (GU) (GU)



Chalmers infrastruktur