The representation and manipulation of the algorithmic probability measure for problem solving

A. J. Gammerman

Research output: Contribution to journalArticle

Abstract

The algorithmic probability measure is a probabilistic measure reflecting the structural complexity of strings of symbols. It has been formulated as a result of work into information theory and algorithmic complexity theory. This paper gives a study of this measure and how it can be approximated and used as the basis for solving problems in the field of artificial intelligence. © 1991 J.C. Baltzer A.G. Scientific Publishing Company.

Original languageEnglish
Pages (from-to)281-300
Number of pages20
JournalAnnals of Mathematics and Artificial Intelligence
Volume4
Issue number3-4
DOIs
Publication statusPublished - Sep 1991

Fingerprint

Information theory
Artificial intelligence
Industry

Cite this

@article{b062087132434695825eb0e169f7e630,
title = "The representation and manipulation of the algorithmic probability measure for problem solving",
abstract = "The algorithmic probability measure is a probabilistic measure reflecting the structural complexity of strings of symbols. It has been formulated as a result of work into information theory and algorithmic complexity theory. This paper gives a study of this measure and how it can be approximated and used as the basis for solving problems in the field of artificial intelligence. {\circledC} 1991 J.C. Baltzer A.G. Scientific Publishing Company.",
author = "Gammerman, {A. J.}",
year = "1991",
month = "9",
doi = "10.1007/BF01531061",
language = "English",
volume = "4",
pages = "281--300",
journal = "Annals of Mathematics and Artificial Intelligence",
issn = "1012-2443",
publisher = "Springer",
number = "3-4",

}

The representation and manipulation of the algorithmic probability measure for problem solving. / Gammerman, A. J.

In: Annals of Mathematics and Artificial Intelligence, Vol. 4, No. 3-4, 09.1991, p. 281-300.

Research output: Contribution to journalArticle

TY - JOUR

T1 - The representation and manipulation of the algorithmic probability measure for problem solving

AU - Gammerman, A. J.

PY - 1991/9

Y1 - 1991/9

N2 - The algorithmic probability measure is a probabilistic measure reflecting the structural complexity of strings of symbols. It has been formulated as a result of work into information theory and algorithmic complexity theory. This paper gives a study of this measure and how it can be approximated and used as the basis for solving problems in the field of artificial intelligence. © 1991 J.C. Baltzer A.G. Scientific Publishing Company.

AB - The algorithmic probability measure is a probabilistic measure reflecting the structural complexity of strings of symbols. It has been formulated as a result of work into information theory and algorithmic complexity theory. This paper gives a study of this measure and how it can be approximated and used as the basis for solving problems in the field of artificial intelligence. © 1991 J.C. Baltzer A.G. Scientific Publishing Company.

UR - http://www.scopus.com/inward/record.url?scp=33947162062&partnerID=8YFLogxK

U2 - 10.1007/BF01531061

DO - 10.1007/BF01531061

M3 - Article

VL - 4

SP - 281

EP - 300

JO - Annals of Mathematics and Artificial Intelligence

JF - Annals of Mathematics and Artificial Intelligence

SN - 1012-2443

IS - 3-4

ER -