scientific article; zbMATH DE number 5064956
From MaRDI portal
Publication:5494239
zbMath1165.03336MaRDI QIDQ5494239
Publication date: 17 October 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Other Turing degree structures (03D28)
Related Items
Bounded Randomness ⋮ Randomness, Computation and Mathematics ⋮ Initial segment complexities of randomness notions ⋮ DEGREES OF RANDOMIZED COMPUTABILITY ⋮ Optimal redundancy in computations from random oracles ⋮ DEEP CLASSES ⋮ Effective Bi-immunity and Randomness ⋮ A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals ⋮ The Information Content of Typical Reals ⋮ The weakness of being cohesive, thin or free in reverse mathematics ⋮ Random numbers as probabilities of machine behavior ⋮ Lowness for bounded randomness ⋮ On the degree spectrum of a $\Pi ^0_1$ class ⋮ Difference randomness ⋮ Highness properties close to PA completeness ⋮ Randomness below complete theories of arithmetic ⋮ A Church-Turing thesis for randomness?
