Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 512814

From MaRDI portal
Publication:4281507
Jump to:navigation, search

zbMATH Open0797.68057MaRDI QIDQ4281507FDOQ4281507


Authors: Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier Edit this on Wikidata


Publication date: 19 October 1994



Title of this publication is not available (Why is that?)



Recommendations

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


zbMATH Keywords

Turing machinehalting problem


Mathematics Subject Classification ID

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



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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4281507&oldid=18202809"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 18:18. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki