Kolmogorov complexity: Revision history

From Polymath Wiki
Jump to navigationJump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

28 August 2009

19 August 2009

3 August 2009

  • curprev 17:2017:20, 3 August 2009Teorth talk contribs 1,214 bytes +1,214 New page: Intuitively speaking, the Kolmogorov complexity of an integer n is the least number of bits one needs to describe n in some suitable language. For instance, one could use the language of ...