The computably enumerable sets: recent results and future directions

zbMATH Open1105.03034MaRDI QIDQ5483300FDOQ5483300

Peter A. Cholak

Publication date: 16 August 2006

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

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)

Cited In (8)

• Orbits of computably enumerable sets: Low sets can avoid an upper cone
• Title not available (Why is that?)
• Comparing C.E. Sets Based on Their Settling Times
• Title not available (Why is that?)
• Computably enumerable sets below random sets
• Computably enumerable sets and quasi-reducibility
• The Complexity of Orbits of Computably Enumerable Sets
• ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE 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)