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

A. J. Gammerman

doi:10.1007/BF01531061

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

A. J. Gammerman

School of Engineering & Physical Sciences

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

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 language	English
Pages (from-to)	281-300
Number of pages	20
Journal	Annals of Mathematics and Artificial Intelligence
Volume	4
Issue number	3-4
DOIs	https://doi.org/10.1007/BF01531061
Publication status	Published - Sept 1991

Access to Document

10.1007/BF01531061

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. {\textcopyright} 1991 J.C. Baltzer A.G. Scientific Publishing Company.",

author = "Gammerman, \{A. J.\}",

year = "1991",

month = sep,

doi = "10.1007/BF01531061",

language = "English",

volume = "4",

pages = "281--300",

journal = "Annals of Mathematics and Artificial Intelligence",

issn = "1012-2443",

publisher = "Springer Netherlands",

number = "3-4",

}

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 - https://www.scopus.com/pages/publications/33947162062

U2 - 10.1007/BF01531061

DO - 10.1007/BF01531061

M3 - Article

SN - 1012-2443

VL - 4

SP - 281

EP - 300

JO - Annals of Mathematics and Artificial Intelligence

JF - Annals of Mathematics and Artificial Intelligence

IS - 3-4

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this