Title of article :
A High-Low Kolmogorov Complexity Law equivalent to the 0–1 Law
Author/Authors :
Marius Zimand، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1996
Keywords :
Kolmogorov complexity , logical definability , Probability asymptotics
Journal title :
Information Processing Letters
Journal title :
Information Processing Letters