On the problem of the critical bound

DOI10.1007/BF02582899MaRDI QIDQ4272259zbMATH OpenFDO

Authors Yuefei Sui

Publication date 10 January 1994

Published in Acta Mathematica Sinica, English Series (Search for Journal in Brave)

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

zbMATH Keywords

minimal pairsr.e. setsTuring reducibility

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Constructing minimal pairs of degrees
• scientific article; zbMATH DE number 4037840
• scientific article; zbMATH DE number 151766
• Minimal pairs in initial segments of the recursively enumerable degrees
• On the existence of a strong minimal pair

Cites work

• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
• Decomposition of Recursively Enumerable Degrees
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 218585 (Why is no real title available?)
• Pseudo Jump Operators. I: The R. E. Case
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• The recursively enumerable degrees are dense
• The weak truth table degrees of recursively enumerable sets
• Uniform enumeration operations
• Wtt-degrees and T-degrees of r.e. sets

This page was built for publication: On the problem of the critical bound

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