scientific article; zbMATH DE number 5064956

MaRDI QIDQ5494239zbMATH OpenFDO

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

(20)

• Pathwise-randomness and models of second-order arithmetic
• Lowness for bounded randomness
• Martin-Löf reducibility and cost functions
• A Church-Turing thesis for randomness?
• Deep _1⁰ classes
• Effective bi-immunity and randomness
• Bounded randomness
• The information content of typical reals
• Initial segment complexities of randomness notions
• Randomness, computation and mathematics
• Degrees of randomized computability
• Complexity of inversion of functions on the reals
• Highness properties close to PA completeness
• 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
• On the degree spectrum of a ^0_1 class
• Difference randomness
• 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)