On the Relation between Descriptional Complexity and Algorithmic Probability

Péter Gács. On the Relation between Descriptional Complexity and Algorithmic Probability. In 22nd Annual Symposium on Foundations of Computer Science, 28-30 October 1981, Nashville, Tennessee, USA. pages 296-303, IEEE, 1981.

@inproceedings{Gacs81,
  title = {On the Relation between Descriptional Complexity and Algorithmic Probability},
  author = {Péter Gács},
  year = {1981},
  researchr = {https://researchr.org/publication/Gacs81},
  cites = {0},
  citedby = {0},
  pages = {296-303},
  booktitle = {22nd Annual Symposium on Foundations of Computer Science, 28-30 October 1981, Nashville, Tennessee, USA},
  publisher = {IEEE},
}