scientific article; zbMATH DE number 3868601

MaRDI QIDQ3334977zbMATH OpenFDO

Authors Yu. V. Golunkov

Publication date 1982

Full work available at URL https://eudml.org/doc/69207

zbMATH Keywords

algorithmic completenesscompleteness problemmaximal subalgebras of precomplete classessystems of algorithmic algebras of graph-schemes of algorithms with memory

Mathematics Subject Classification ID

Subalgebras, congruence relations (08A30) Algorithms in computer science (68W99)

Recommendations

• scientific article; zbMATH DE number 3868602
• scientific article; zbMATH DE number 3841851
• Approximate completeness in algebras of partial recursive functions and predicates
• scientific article; zbMATH DE number 3993565
• scientific article; zbMATH DE number 23020

Cited in

(5)

• Algebra of algorithms and Kaluzhnin's graph-schemas
• scientific article; zbMATH DE number 3841851 (Why is no real title available?)
• Identical transformations in algebras of nondeterministic algorithms. II
• On the preservation of the properties of many-sorted algebraic systems
• Preserving categoricity and complexity of relations

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