Bayesianism: An algorithmic analysis

DOI10.1006/INCO.1996.0045MaRDI QIDQ1923084zbMATH OpenOpenAlexFDO

Authors Vladimir V. V'yugin

Publication date 25 November 1996

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1996.0045

zbMATH Keywords

Bayesian programcomputable calibration

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 472936
• Mechanical learners pay a price for Bayesianism
• scientific article; zbMATH DE number 1432028

Cited in

(8)

• Non-stochastic infinite and finite sequences
• How Bayesian analysis cracked the red-state, blue-state problem
• Having a look at the Bayes blind spot
• Computable Bayesian compression for uniformly discretizable statistical models
• Mechanical learners pay a price for Bayesianism
• On the computability of conditional probability
• Optimal polynomial-time estimators: a Bayesian notion of approximation algorithm
• Is there a stability problem for Bayesian noncommutative probabilities?

This page was built for publication: Bayesianism: An algorithmic analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923084)