scientific article; zbMATH DE number 4154429

MaRDI QIDQ3483273zbMATH OpenFDO

Authors Alexandra Soskova

Publication date 1990

zbMATH Keywords

admissibilitycomputable functionseffective computability on many-sorted partial structuresparallel computabilityrecursively enumerable definitional schemessearch computability

Mathematics Subject Classification ID

Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• scientific article; zbMATH DE number 4145891
• scientific article; zbMATH DE number 4154430
• Second Order Definability Via enumerations
• Definability via enumerations
• scientific article; zbMATH DE number 218551

Cited in

(7)

• Computability by means of effectively definable schemes and definability via enumerations
• Multiple permitting and array noncomputability
• An external approach to abstract data types. I: Computability on abstract data type
• scientific article; zbMATH DE number 4145891 (Why is no real title available?)
• Definability via enumerations
• scientific article; zbMATH DE number 4154430 (Why is no real title available?)
• Effective applicative 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 Q3483273)