The representation and manipulation of the algorithmic probability measure for problem solving.
type: Item
instance of: scholarly article
title: The representation and manipulation of the algorithmic probability measure for problem solving.
zbMATH Open document ID: 1034.68546
DOI: 10.1007/BF01531061
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1997-05-13T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 1005863
zbMATH Keywords: algorithmic complexity theory
zbMATH Keywords: algorithmic probability measure
Wikidata QID: Q62666532
author: Alexander Gammerman
MaRDI profile type: Publication
cites work: A formal theory of inductive inference. Part I
cites work: On the Length of Programs for Computing Finite Binary Sequences
cites work: Q3214803
cites work: On the difficulty of computations
cites work: Complexity-based induction systems: Comparisons and convergence theorems
cites work: Q5578545
cites work: Information-theoretic computation complexity
full work available at URL: https://doi.org/10.1007/bf01531061
OpenAlex ID: W2067623858
DBLP publication ID: journals/amai/Gammerman91
description: scientific article; zbMATH DE number 1005863