Universality, optimality, and randomness deficiency
نویسندگان
چکیده
منابع مشابه
Universality, optimality, and randomness deficiency
A Martin-Löf test U is universal if it captures all non-Martin-Löf random sequences, and it is optimal if for every ML-test V there is a c ∈ ω such that ∀n(Vn+c ⊆ Un). We study the computational differences between universal and optimal ML-tests as well as the effects that these differences have on both the notion of layerwise computability and the Weihrauch degree of LAY, the function that pro...
متن کاملSophistication as Randomness Deficiency
The sophistication of a string measures how much structural information it contains. We introduce naive sophistication, a variant of sophistication based on randomness deficiency. Naive sophistication measures the minimum number of bits needed to specify a set in which the string is a typical element. Thanks to Vereshchagin and Vitányi, we know that sophistication and naive sophistication are e...
متن کاملMultiple Access Networks Over Finite Fields - Optimality of Separation, Randomness and Linearity
We consider a time-slotted multiple access noisy as well as noise-free channel in which the received, transmit and noise alphabets belong to a finite field. We show that source-channel separation holds when the additive noise is independent of inputs. However, for input-dependent noise, separation may not hold. For channels over the binary field, we derive the expression for the probability of ...
متن کاملω-Change Randomness and Weak Demuth Randomness
We extend our work on difference randomness. Each component of a difference test is a Boolean combination of two r.e. open sets; here we consider tests in which the k component is a Boolean combination of g(k) r.e. open sets for a given recursive function g. We use this method to produce an alternate characterization of weak Demuth randomness in terms of these tests and further show that a real...
متن کاملRandomness and Pseudo-Randomness in Discrete Mathematics
The discovery, demonstrated in the early work of Paley, Zygmund, Erdős, Kac, Turán, Shannon, Szele and others, that deterministic statements can be proved by probabilistic reasoning, led already in the first half of the century to several striking results in Analysis, Number Theory, Combinatorics and Information Theory. It soon became clear that the method, which is now called the probabilistic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2015
ISSN: 0168-0072
DOI: 10.1016/j.apal.2015.05.006