Algorithmic Identification of Probabilities Is Hard
From MaRDI portal
Publication:2938725
DOI10.1007/978-3-319-11662-4_7zbMath1432.68204OpenAlexW2949603196MaRDI QIDQ2938725
Laurent Bienvenu, Alexander Shen, Benoit Monin
Publication date: 14 January 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-11662-4_7
Computational learning theory (68Q32) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Computability theory. Abstracts from the workshop held January 7--13, 2018, Identification of probabilities, Equivalences between learning of data and probability distributions, and their applications