Algorithmic Statistics Revisited (Q2805729)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Algorithmic Statistics Revisited	scientific article

Statements

scholarly article

0 references

Algorithmic Statistics Revisited (English)

0 references

0 references

Nikolai K. Vereshchagin

0 references

Measures of Complexity

0 references

publication date

13 May 2016

0 references

full work available at URL

https://arxiv.org/abs/1504.04950

0 references

MaRDI profile type

MaRDI publication profile

0 references

Computational depth: Concept and applications

0 references

Algorithmic Information Theory

0 references

Inequalities for Shannon entropy and Kolmogorov complexity

0 references

Randomness conservation inequalities; information and independence in mathematical theories

0 references

An introduction to Kolmogorov complexity and its applications

0 references

Stability of properties of Kolmogorov complexity under relativization

0 references

Mathematical metaphysics of randomness

0 references

A universal prior for integers and estimation by minimum description length

0 references

Combinatorial interpretation of Kolmogorov complexity

0 references

0 references

Algorithmic Minimal Sufficient Statistic Revisited

0 references

Kolmogorov's Structure Functions and Model Selection

0 references

Rate Distortion and Denoising of Individual Data Using Kolmogorov Complexity

0 references

Nonstochastic estimates

0 references

Does snooping help?

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-21852-6_17

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2805729

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2805729&oldid=36248931"