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

DOI10.1007/BF01531061zbMath1034.68546DBLPjournals/amai/Gammerman91OpenAlexW2067623858WikidataQ62666532 ScholiaQ62666532MaRDI QIDQ1354086

Alexander Gammerman

Publication date: 13 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01531061

zbMATH Keywords

algorithmic complexity theoryalgorithmic probability measure

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Complexity-based induction systems: Comparisons and convergence theorems
• Information-theoretic computation complexity
• On the Length of Programs for Computing Finite Binary Sequences
• On the difficulty of computations
• A formal theory of inductive inference. Part I
• Unnamed Item
• Unnamed Item

This page was built for publication: The representation and manipulation of the algorithmic probability measure for problem solving.