A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
type: Item
instance of: scholarly article
title: A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
zbMATH Open document ID: 0896.68080
published in: Theory of Computing Systems
publication date: 1998-10-01T00:00:00Z
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 1160530
zbMATH Keywords: Kolmogorov complexity
author: Ludwig Staiger
MaRDI profile type: Publication
full work available at URL: s002240000086
OpenAlex ID: W2020728339
DOI: 10.1007/S002240000086
Recommended article: Q3348834
Recommended article: Q4251061
Recommended article: Q4473554
Recommended article: Q4694334
Recommended article: Conditional Kolmogorov complexity and universal probability
Recommended article: Q3827541
Recommended article: Kolmogorov Complexity and Model Selection
Recommended article: Approximating Kolmogorov complexity
Recommended article: Q6161054
Recommended article: Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
description: scientific article; zbMATH DE number 1160530