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

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

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)

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

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)