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 | |
| Publication status | Published - Sept 1991 |