scientific article; zbMATH DE number 3896921

MaRDI QIDQ3676134zbMATH OpenFDO

Authors G. V. Zdebskaya

Publication date 1982

zbMATH Keywords

degree of unsolvabilitylimiting recursive functions

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• scientific article; zbMATH DE number 3966055
• scientific article; zbMATH DE number 3865259
• scientific article; zbMATH DE number 4004170
• scientific article; zbMATH DE number 4057497
• LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS

Cited in

(9)

• Computably enumerable sets and quasi-reducibility
• scientific article; zbMATH DE number 5761697 (Why is no real title available?)
• scientific article; zbMATH DE number 3966055 (Why is no real title available?)
• scientific article; zbMATH DE number 4087649 (Why is no real title available?)
• Post's program and incomplete recursively enumerable sets.
• scientific article; zbMATH DE number 1138314 (Why is no real title available?)
• Computably enumerable sets below random sets
• Complexity properties of recursively enumerable sets and bsQ-completeness
• On a problem posed by Steve Smale

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 Q3676134)