DOIAbstract
Given any function f with σn=0∞ 2−f(n) divergent, it is shown that every finite binary sequence x has an infinite number of initial segments, xn, with K(xn) ⩽ n − f(n)
Given any function f with σn=0∞ 2−f(n) divergent, it is shown that every finite binary sequence x has an infinite number of initial segments, xn, with K(xn) ⩽ n − f(n)
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-mo...
Every infinite sequence is Turing-reducible to an infinite sequence which is random in the sense of ...
10.1090/S0002-9947-08-04395-XTransactions of the American Mathematical Society36063193-321
Given any function f with σn=0∞ 2−f(n) divergent, it is shown that every finite binary sequence x ha...
Let us say that an infinite binary sequence q lies above an infinite binary sequence p if q can be o...
AbstractThe structure of the K-degrees provides a way to classify sets of natural numbers or infinit...
Kolmogorov has defined the conditional complexity of an object y when the object x is already given ...
AbstractWe study oscillation in the prefix-free complexity of initial segments of 1-random reals. Fo...
AbstractThe sequences which have trivial prefix-free initial segment complexity are known as K-trivi...
The sequences which have trivial prefix-free initial segment complexity are known as K-trivial sets,...
The sequences which have trivial prefix-free initial segment complexity are known as K-trivial sets,...
The sequences which have trivial prefix-free initial segment complexity are known as K-trivial sets,...
The sequences which have trivial prefix-free initial segment complexity are known as K-trivial sets,...
We consider two quantities that measure complexity of binary strings: KM(x) is defined as the minus ...
For every binary sequence A, there is an infinite binary sequence S such that A P tt S and S is s...
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-mo...
Every infinite sequence is Turing-reducible to an infinite sequence which is random in the sense of ...
10.1090/S0002-9947-08-04395-XTransactions of the American Mathematical Society36063193-321
Given any function f with σn=0∞ 2−f(n) divergent, it is shown that every finite binary sequence x ha...
Let us say that an infinite binary sequence q lies above an infinite binary sequence p if q can be o...
AbstractThe structure of the K-degrees provides a way to classify sets of natural numbers or infinit...
Kolmogorov has defined the conditional complexity of an object y when the object x is already given ...
AbstractWe study oscillation in the prefix-free complexity of initial segments of 1-random reals. Fo...
AbstractThe sequences which have trivial prefix-free initial segment complexity are known as K-trivi...
The sequences which have trivial prefix-free initial segment complexity are known as K-trivial sets,...
The sequences which have trivial prefix-free initial segment complexity are known as K-trivial sets,...
The sequences which have trivial prefix-free initial segment complexity are known as K-trivial sets,...
The sequences which have trivial prefix-free initial segment complexity are known as K-trivial sets,...
We consider two quantities that measure complexity of binary strings: KM(x) is defined as the minus ...
For every binary sequence A, there is an infinite binary sequence S such that A P tt S and S is s...
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-mo...
Every infinite sequence is Turing-reducible to an infinite sequence which is random in the sense of ...
10.1090/S0002-9947-08-04395-XTransactions of the American Mathematical Society36063193-321
Add to ORKG