Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

We introduce a new, elementary method for studying random differences in arithmetic progressions and convergence phenomena along… Expand

Is this relevant?

Highly Cited

2012

Highly Cited

2012

Where you can find the algorithmic randomness and complexity theory and applications of computability easily? Is it in the book… Expand

Is this relevant?

Highly Cited

2010

Highly Cited

2010

Preface.- Acknowledgments.- Introduction.- I. Background.- Preliminaries.- Computability Theory.- Kolmogorov Complexity of Finite… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and… Expand

Is this relevant?

2002

2002

• Even if definable, a “truly” random sequence is difficult for a computer (or human) to produce. • For most purposes, need only… Expand

Is this relevant?

Highly Cited

1999

Highly Cited

1999

Machine-LearningApplicationsofAlgorithmicRandomnessVolodyaovk,AlexGammerman… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

In the framework of the Kolmogorov's approach to the substantiation of the probability theory and information theory on the base… Expand

Is this relevant?

1997

1992

1992

Every class C of languages satisfying a simple topological condition is shown to have probability one if and only if it contains… Expand

Is this relevant?

Highly Cited

1988

Highly Cited

1988

Some mathematical and natural objects (a random sequence, a sequence of zeros, a perfect crystal, a gas) are intuitively trivial… Expand

Is this relevant?