Two more characterizations of \(K\)-triviality

DOI10.1215/00294527-2017-0021zbMath1453.03041OpenAlexW2738350823MaRDI QIDQ1750296

Noam Greenberg, Benoit Monin, Joseph S. Miller, Daniel D. Turetsky

Publication date: 18 May 2018

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1215/00294527-2017-0021

zbMATH Keywords

Kolmogorov complexityMartin-Löf randomness\(K\)-triviality

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items (2)

HIGHER RANDOMNESS AND GENERICITY ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Characterizing strong randomness via Martin-Löf randomness
• Cone avoidance and randomness preservation
• Lowness properties and randomness
• Algorithmic Randomness and Complexity
• Cupping with random sets
• RELATIVIZING CHAITIN'S HALTING PROBABILITY
• On initial segment complexity and degrees of randomness
• Degrees joining to 0′
• Every sequence is reducible to a random one
• Algorithmic Information Theory
• The axiomatization of randomness
• Measures and their random reals
• Low for random reals and positive-measure domination
• Using random sets as oracles

This page was built for publication: Two more characterizations of \(K\)-triviality