scientific article; zbMATH DE number 3353267

MaRDI QIDQ5628115zbMATH OpenFDO

Authors Yu. Matiyasevich

Publication date 1970

Mathematics Subject Classification ID

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

Cited in

(4)

• Toward a theory of intelligence
• On computational complexity of graph inference from counting
• Weakly associative relation algebras with projections
• Absoluteness of subword inequality is undecidable

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