Theory and Applications of Models of Computation

DOI10.1007/11750321zbMath1178.03052OpenAlexW4296156427MaRDI QIDQ5898928

Liang Yu, Frank Stephan

Publication date: 30 April 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11750321

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)

Related Items (7)

HIGHER RANDOMNESS AND GENERICITY ⋮ Lowness of higher randomness notions ⋮ Lowness for Demuth Randomness ⋮ Computable analogs of cardinal characteristics: prediction and rearrangement ⋮ Relativized Schnorr tests with universal behavior ⋮ Kolmogorov complexity and the Recursion Theorem ⋮ Unified characterizations of lowness properties via Kolmogorov complexity

This page was built for publication: Theory and Applications of Models of Computation