Constructive Dimension and Weak Truth-Table Degrees

DOI10.1007/978-3-540-73001-9_7zbMath1151.03333OpenAlexW1557375800MaRDI QIDQ5426866

Laurent Bienvenu, David Doty, Frank Stephan

Publication date: 13 November 2007

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73001-9_7

zbMATH Keywords

degreerandomnessextractorconstructive dimensionweak truth-table

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (7)

Algorithmically Independent Sequences ⋮ Algorithmically independent sequences ⋮ Turing degrees of reals of positive effective packing dimension ⋮ Extracting Kolmogorov complexity with applications to dimension zero-one laws ⋮ Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences ⋮ Constructive dimension and Turing degrees ⋮ Dimension extractors and optimal decompression

This page was built for publication: Constructive Dimension and Weak Truth-Table Degrees