Talk:Algorithmically random sequence

From Wikipedia, the free encyclopedia

[edit] RAND is Sigma^0_2

It is correct to say that RAND is Sigma^0_2, because there is a Sigma^0_2 formula that defines the class of 1-random real numbers. It is not true that every random real is itself Sigma^0_2; there are 1-random reals of arbitrarily high Turing degree. CMummert 23:41, 23 June 2006 (UTC)

[edit] Edit today

Here are some comments on the changes I made today

  • It is not NPOV to describe some things are very technical and describe other things as very easy. My impressions of easy and hard are in fact the opposite of the opinions the article used to have. In any event, there is no reason to lecture the reader about how hard some idea is. I removed all such comments.
  • I rewrote the Martin-Löf definition in topological language, which should be more clear.
  • I made other small changes.

CMummert 14:00, 24 June 2006 (UTC)

[edit] Lebesgue measure

I don't think it's proper to call the measure of a cylinder Lebesgue measure. A cylinder isn't a subset of R^n. It's not internally consistent even with Wikipedia's current definition of Lebesgue measure. ~~

I rephrased it to say fair coin measure. Everyone can edit, so you can make changes like that yourself to save time. CMummert 14:58, 27 July 2006 (UTC)
Retrieved from "http://en.wikipedia.org../../../a/l/g/Talk%7EAlgorithmically_random_sequence_0432.html"