scientific article; zbMATH DE number 4145890

MaRDI QIDQ3476802zbMATH OpenFDO

Authors Angel V. Ditchev

Publication date 1987

zbMATH Keywords

admissibilityrelative computabilitysearch computability

Mathematics Subject Classification ID

Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• Computability and numberings
• scientific article; zbMATH DE number 1873434
• scientific article; zbMATH DE number 1222114
• scientific article; zbMATH DE number 1163992
• Representations versus numberings: On the relationship of two computability notions
• scientific article; zbMATH DE number 5263512
• scientific article; zbMATH DE number 5875139
• Computably enumerable sets and related issues
• The number of nonequivalent computable indexations for a fixed family of sets
• Computable numberings to which noncomputable numberings are positively reducible

Cited in

(2)

• Definability via enumerations
• Exact effective enumerations of total functional structures

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