On trees without hyperimmune branches

DOI10.1007/978-3-031-08740-0_20MaRDI QIDQ2104272zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 7 December 2022

Full work available at URL https://doi.org/10.1007/978-3-031-08740-0_20

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A criterion for completeness of degrees of unsolvability
• A Theorem on Hypersimple Sets
• An introduction to Kolmogorov complexity and its applications
• Classical recursion theory. The theory of functions and sets of natural numbers
• Computability and Randomness
• Computational aspects of the hyperimmune-free degrees
• Effective domination and the bounded jump
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1911266 (Why is no real title available?)
• scientific article; zbMATH DE number 3336816 (Why is no real title available?)
• On \(\Pi{}^ 0_ 1\) classes and their ranked points
• On degrees of recursive unsolvability
• On the degrees less than 0'
• Randomness for computable measures and initial segment complexity
• Reals which compute little
• Recursively enumerable sets of positive integers and their decision problems
• Schnorr trivial sets and truth-table reducibility
• The Degrees of Hyperimmune Sets
• ∏ 0 1 Classes and Degrees of Theories

This page was built for publication: On trees without hyperimmune branches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104272)