Identification of probabilities

DOI10.1016/j.jmp.2016.11.004zbMath1396.91659arXiv1708.01611OpenAlexW2761369391WikidataQ37686913 ScholiaQ37686913MaRDI QIDQ514153

Paul M. B. Vitányi, Nick Chater

Publication date: 28 February 2017

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.01611

zbMATH Keywords

strong law of large numberslearningKolmogorov complexityMarkov chainMartin-Löf randomnesstypicalityBayesian brain, identificationcomputable measurecomputable probability

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Learning and adaptive systems in artificial intelligence (68T05) Memory and learning in psychology (91E40)

Related Items (4)

Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy ⋮ Absolutely no free lunches! ⋮ Algorithmic identification of probabilities is hard ⋮ Equivalences between learning of data and probability distributions, and their applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning recursive functions: A survey
• `Ideal learning' of natural language: positive results about learning from positive evidence
• Algorithmic Identification of Probabilities Is Hard
• How to Grow a Mind: Statistics, Structure, and Abstraction
• Prediction and Entropy of Printed English
• Merging of Opinions with Increasing Information
• Minimum complexity density estimation
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Limiting recursion
• The definition of random sequences
• Language identification in the limit
• A formal theory of inductive inference. Part II
• On Computable Numbers, with an Application to the Entscheidungsproblem
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: Identification of probabilities