Title of article :
Characterising the Martin-Löf random sequences using computably enumerable sets of measure one
Author/Authors :
George Davie، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2004
Pages :
4
From page :
157
To page :
160
Keywords :
Martin-L?f random , Kolmogorov complexity , Probability law , computational complexity , Compressibility coefficient
Journal title :
Information Processing Letters
Serial Year :
2004
Journal title :
Information Processing Letters
Record number :
129983
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=129983