Algorithmic Identification of Probabilities Is Hard

Laurent Bienvenu, Benoit Monin, Alexander Shen. Algorithmic Identification of Probabilities Is Hard. In Peter Auer, Alexander Clark, Thomas Zeugmann, Sandra Zilles, editors, Algorithmic Learning Theory - 25th International Conference, ALT 2014, Bled, Slovenia, October 8-10, 2014. Proceedings. Volume 8776 of Lecture Notes in Computer Science, pages 85-95, Springer, 2014. [doi]

@inproceedings{BienvenuMS14,
  title = {Algorithmic Identification of Probabilities Is Hard},
  author = {Laurent Bienvenu and Benoit Monin and Alexander Shen},
  year = {2014},
  doi = {10.1007/978-3-319-11662-4_7},
  url = {http://dx.doi.org/10.1007/978-3-319-11662-4_7},
  researchr = {https://researchr.org/publication/BienvenuMS14},
  cites = {0},
  citedby = {0},
  pages = {85-95},
  booktitle = {Algorithmic Learning Theory - 25th International Conference, ALT 2014, Bled, Slovenia, October 8-10, 2014. Proceedings},
  editor = {Peter Auer and Alexander Clark and Thomas Zeugmann and Sandra Zilles},
  volume = {8776},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-11661-7},
}