The computably enumerable sets: recent results and future directions

MaRDI QIDQ5483300zbMATH OpenFDO

Authors Peter A. Cholak

Publication date 16 August 2006

zbMATH Keywords

survey

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25) Future perspectives in mathematics (01A67)

Recommendations

• On the orbits of computably enumerable sets
• Computably enumerable sets and related issues
• Extension theorems, orbits, and automorphisms of the computably enumerable sets
• The Complexity of Orbits of Computably Enumerable Sets
• On orbits, of prompt and low computably enumerable sets

Cited in

(13)

• Orbits of computably enumerable sets: Low sets can avoid an upper cone
• scientific article; zbMATH DE number 1531936 (Why is no real title available?)
• Some recent research directions in the computably enumerable sets
• Comparing C.E. Sets Based on Their Settling Times
• scientific article; zbMATH DE number 1390017 (Why is no real title available?)
• Computably enumerable sets below random sets
• Computably enumerable sets and related issues
• On the orbits of computably enumerable sets
• A journey to computably enumerable structures (tutorial lectures)
• Computably enumerable sets and quasi-reducibility
• The Complexity of Orbits of Computably Enumerable Sets
• ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
• Computably enumerable sets that are automorphic to low sets

This page was built for publication: The computably enumerable sets: recent results and future directions

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