scientific article; zbMATH DE number 5064956
From MaRDI portal
Publication:5494239
zbMATH Open1165.03336MaRDI QIDQ5494239FDOQ5494239
Publication date: 17 October 2006
Title of this publication is not available (Why is that?)
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other Turing degree structures (03D28) Applications of computability and recursion theory (03D80)
Cited In (19)
- Pathwise-randomness and models of second-order arithmetic
- Lowness for bounded randomness
- Martin-Löf reducibility and cost functions
- On the degree spectrum of a $\Pi ^0_1$ class
- A Church-Turing thesis for randomness?
- DEGREES OF RANDOMIZED COMPUTABILITY
- Initial segment complexities of randomness notions
- Effective Bi-immunity and Randomness
- Bounded Randomness
- Highness properties close to PA completeness
- Randomness, Computation and Mathematics
- Optimal redundancy in computations from random oracles
- A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals
- The weakness of being cohesive, thin or free in reverse mathematics
- Randomness below complete theories of arithmetic
- The Information Content of Typical Reals
- Difference randomness
- DEEP CLASSES
- Random numbers as probabilities of machine behavior
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494239)
