scientific article; zbMATH DE number 7204368

DOI10.4230/LIPICS.MFCS.2017.34zbMATH Open1441.03029MaRDI QIDQ5111248FDOQ5111248

Benoit Monin, Paul-Elliot Anglès d'Auriac

Publication date: 26 May 2020

Title of this publication is not available (Why is that?)

Recommendations

• Two more characterizations of \(K\)-triviality
• scientific article; zbMATH DE number 2247262
• A higher rank version of Kitai's theorem
• A CHARACTERIZATION OF CERTAIN MORPHIC TRIVIAL EXTENSIONS
• A characterization of \(k\)-normal varieties
• A characterization of Dedekind structures
• A characterization of KK-theory
• A universal characterization of higher algebraic \(K\)-theory
• scientific article; zbMATH DE number 6133026
• Some characterizations of Krull domains

zbMATH Keywords

Kolmogorov complexityalgorithmic randomnesseffective descriptive set theoryK-trivialityhigher computability

Mathematics Subject Classification ID

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

Cites Work

• Algorithmic Randomness and Complexity
• Title not available (Why is that?)
• Title not available (Why is that?)
• The definition of random sequences
• Lowness properties and randomness
• Lowness notions, measure and domination
• Title not available (Why is that?)
• Randomness via effective descriptive set theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lowness and nullsets
• Infinite time Turing machines
• Computuing \(K\)-trivial sets by incomplete random sets
• Using random sets as oracles
• Lowness of higher randomness notions
• Cupping with random sets
• Recursion theory. Computational aspects of definability
• Two more characterizations of \(K\)-triviality
• Continuous higher randomness
• Higher randomness and forcing with closed sets
• HIGHER RANDOMNESS AND GENERICITY
• Thin Maximal Antichains in the Turing Degrees

Cited In (1)

• GENERICITY AND RANDOMNESS WITH ITTMS

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 Q5111248)