Binary subtrees with few labeled paths

DOI10.1007/s00493-011-2634-3zbMath1265.05593OpenAlexW2120482717MaRDI QIDQ654001

Kevin G. Milans, Noam Greenberg, Carl G. jun. Jockusch, Rodney G. Downey

Publication date: 20 December 2011

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-011-2634-3

zbMATH Keywords

Baire spacecomputability theoryrandomnessCantor spacebinary subtreeKurtz random setMedvedev degreestrong reducibilityternary edge-labeled tree

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Extremal combinatorics (05D99)

Related Items

On the uniform computational content of computability theory, The coding power of a product of partitions, FORCING WITH BUSHY TREES, Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions, Diagonally Non-Computable Functions and Bi-Immunity, Weihrauch Complexity in Computable Analysis

Cites Work

• Unnamed Item
• The Medvedev lattice of computably closed sets
• Difference sets and inverting the difference operator
• Algorithmic Randomness and Complexity
• Mass Problems and Randomness
• Calibrating Randomness
• On the Equimorphism Types of Linear Orderings
• An Effective Version of Dilworth's Theorem
• Functional iteration and the Josephus problem
• The McKinsey axiom is not canonical
• Diagonally non-recursive functions and effective Hausdorff dimension
• The canonical Ramsey theorem and computability theory