> >

Kolmogorov Complexity in Combinatory Logic
Online article by John Tromp. Kolmogorov complexity is a recursion theoretic characterisation of randomness.

Keyword Results for
this URL
Total
searches