scientific article; zbMATH DE number 7204368
From MaRDI portal
Publication:5111248
DOI10.4230/LIPIcs.MFCS.2017.34zbMath1441.03029MaRDI QIDQ5111248
Benoit Monin, Paul-Elliot Anglès d'Auriac
Publication date: 26 May 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kolmogorov complexityalgorithmic randomnesseffective descriptive set theoryK-trivialityhigher computability
Descriptive set theory (03E15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lowness of higher randomness notions
- Two more characterizations of \(K\)-triviality
- Recursion theory. Computational aspects of definability
- Lowness properties and randomness
- Lowness notions, measure and domination
- COMPUTINGK-TRIVIAL SETS BY INCOMPLETE RANDOM SETS
- Higher randomness and forcing with closed sets
- Algorithmic Randomness and Complexity
- Cupping with random sets
- Lowness and nullsets
- Infinite time Turing machines
- HIGHER RANDOMNESS AND GENERICITY
- Continuous higher randomness
- Randomness via effective descriptive set theory
- Using random sets as oracles
- Thin Maximal Antichains in the Turing Degrees
- The definition of random sequences
This page was built for publication:
