scientific article; zbMATH DE number 512814

MaRDI QIDQ4281507zbMATH OpenFDO

Authors Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier

Publication date 19 October 1994

zbMATH Keywords

Turing machinehalting problem

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Undecidability and degrees of sets of sentences (03D35)

Recommendations

• scientific article; zbMATH DE number 1555187
• scientific article; zbMATH DE number 1256672
• Satisfiability of the smallest binary program
• Smallest horn clause programs

Cited in

(7)

• Deciding the bisimilarity relation between Datalog goals
• Satisfiability of the smallest binary program
• \(\exists\)-Universal termination of logic programs
• On the complexity of single-rule datalog queries.
• Weighted systems of equations
• Thue trees
• Primal grammars and unification modulo a binary clause

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