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 Dive into the research topics of 'The representation and manipulation of the algorithmic probability measure for problem solving'. Together they form a unique fingerprint.

  • Cite this