Intuitively, an algorithmically random sequence (or random sequence) is an infinite sequence of binary digits that appears random to any algorithm… (More)

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

2011

2011

- Hayato Takahashi
- Inf. Comput.
- 2011

We study algorithmic randomness and monotone complexity on product of the set of infinite binary sequences. We explore the… (More)

Is this relevant?

2009

2009

- Logan M. Axon
- 2009

by Logan M. Axon Algorithmic randomness in the Cantor space, 2 ω , has recently become the subject of intense study. Originally… (More)

Is this relevant?

2005

2005

- Masataka Nakamura
- IEEE Information Theory Workshop, 2005.
- 2005

We extend the recurrence time theorem, which is originally derived by Wyner and Ziv, to individual Martin-Lof random sequences… (More)

Is this relevant?

2000

2000

- Todd Ebert, Heribert Vollmer
- MFCS
- 2000

A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an… (More)

Is this relevant?

1998

1998

- Steven M. Kautz
- Theor. Comput. Sci.
- 1998

Results on random oracles typically involve showing that a class {X : P (X)} has Lebesgue measure one, i.e., that some property P… (More)

Is this relevant?

1998

1998

- Vladimir V. V'yugin
- Theor. Comput. Sci.
- 1998

In the framework of the Kolmogorov’s approach to the substantiation of the probability theory and information theory on the base… (More)

Is this relevant?

1997

1997

We prove that there are uncountably many sets that are low for the class of Schnorr random reals. We give a purely recursion… (More)

Is this relevant?

1994

1994

- Steven M. Kautz
- ArXiv
- 1994

A bounded Kolmogorov-Loveland selection rule is an adaptive strategy for recursively selecting a subsequence of an infinite… (More)

Is this relevant?

1993

1993

- Cristian S. Calude
- Developments in Language Theory
- 1993

We prove that all random sequences (in Chaitin-Martin-Lof sense) and almost all random strings (in both Kolmogorov-Chaitin and… (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Zurek
- Physical review. A, General physics
- 1989

Algorithmic randomness provides a rigorous, entropylike measure of disorder of an individual, microscopic, definite state of a… (More)

Is this relevant?