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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.