scientific article; zbMATH DE number 5064956

zbMATH Open1165.03336MaRDI QIDQ5494239FDOQ5494239

Authors Frank Stephan

Publication date 17 October 2006

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other Turing degree structures (03D28) Applications of computability and recursion theory (03D80)

Cited in

(19)

• Bounded randomness
• Randomness below complete theories of arithmetic
• A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals
• Pathwise-randomness and models of second-order arithmetic
• Randomness, computation and mathematics
• A Church-Turing thesis for randomness?
• Effective bi-immunity and randomness
• Highness properties close to PA completeness
• Lowness for bounded randomness
• Difference randomness
• Initial segment complexities of randomness notions
• Optimal redundancy in computations from random oracles
• On the degree spectrum of a \(\Pi ^0_1\) class
• Deep \(\Pi_1^0\) classes
• The information content of typical reals
• Random numbers as probabilities of machine behavior
• The weakness of being cohesive, thin or free in reverse mathematics
• Martin-Löf reducibility and cost functions
• Degrees of randomized computability

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)