scientific article; zbMATH DE number 1390017

MaRDI QIDQ4934282zbMATH OpenFDO

Authors Robert I. Soare

Publication date 29 June 2000

zbMATH Keywords

computably enumerable sets

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25)

Review text

A well-written, concise exposition of the theory of computably enumerable sets. Note the change in terminology (initiated by the author a few years ago): computably enumerable instead of recursively enumerable. For the entire collection see [Zbl 0923.03001].

Recommendations

• On a Class of Recursively Enumerable Sets
• Computably enumerable sets and related issues
• The computably enumerable sets: recent results and future directions
• scientific article; zbMATH DE number 4091484
• scientific article; zbMATH DE number 871851

Cited in

(9)

• Turing oracle machines, online computing, and three displacements in computability theory
• Definable properties of the computably enumerable sets
• Computably enumerable sets and quasi-reducibility
• scientific article; zbMATH DE number 1163992 (Why is no real title available?)
• Computably enumerable sets below random sets
• scientific article; zbMATH DE number 871851 (Why is no real title available?)
• Computing sets from all infinite subsets
• Some recent research directions in the computably enumerable sets
• Computably enumerable sets and related issues

This page was built for publication:

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