scientific article; zbMATH DE number 2080439
From MaRDI portal
Publication:4473230
zbMATH Open1046.68549MaRDI QIDQ4473230FDOQ4473230
Authors: Peter Gács, John Tromp, Paul M. B. Vitányi
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1968/19680041.htm
Title of this publication is not available (Why is that?)
Recommendations
Computational learning theory (68Q32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Cited In (19)
- Algorithmic statistics
- Algorithmic minimal sufficient statistics: a new approach
- Algorithmic statistics revisited
- Algorithmic statistics, prediction and machine learning
- Algorithmic statistics: normal objects and universal models
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithmic minimal sufficient statistic revisited
- On algorithmic strong sufficient statistics
- Present Position and Potential Developments: Some Personal Views: Statistical Computing
- Correction to "Algorithmic statistics"
- Winograd's algorithm statistically revisited: it pays to weigh than to count!
- Title not available (Why is that?)
- Meaningful Information
- Algorithmic statistics: forty years later
- Challenges in statistical theory: complex data structures and algorithmic optimization. Abstracts from the workshop held August 23rd -- August 29th, 2009
- Algorithmic relative complexity
- Title not available (Why is that?)
- Kolmogorov's Structure Functions and Model Selection
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473230)