Joining non-low C.E. sets with diagonally non-computable functions

DOI10.1093/logcom/ext039zbMath1327.03033OpenAlexW2166519426MaRDI QIDQ5406113

André Nies, Joseph S. Miller, Noam Greenberg, Laurent Bienvenu, Antonín Kučera, Dan Turetsky

Publication date: 1 April 2014

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/ext039

zbMATH Keywords

Kolmogorov complexitydiagonally non-computable functionsnon-low c.e. sets

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Recursively (computably) enumerable sets and degrees (03D25) Algorithmic randomness and dimension (03D32)

Related Items (1)

Another note on the join property

This page was built for publication: Joining non-low C.E. sets with diagonally non-computable functions