Stationary algorithmic probability
type: Item
instance of: scholarly article
title: Stationary algorithmic probability
zbMATH Open document ID: 1189.68067
published in: Theoretical Computer Science
publication date: 2009-12-01T00:00:00Z
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 5641354
zbMATH Keywords: algorithmic probability
zbMATH Keywords: Kolmogorov complexity
zbMATH Keywords: Markov chain
zbMATH Keywords: emulation
zbMATH Keywords: emulation complexity
author: Markus Müller
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.09.017
OpenAlex ID: W1678579760
cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
cites work: A Theory of Program Size Formally Identical to Information Theory
cites work: Q4337021
cites work: The discovery of algorithmic probability
cites work: Universal artificial intelligence. Sequential decisions based on algorithmic probability.
cites work: Algorithmic information and simplicity in statistical physics
cites work: Information, randomness and incompleteness. Papers on algorithmic information theory
DOI: 10.1016/J.TCS.2009.09.017
description: scientific article; zbMATH DE number 5641354