On the Computational Power of Querying the History

DOI10.3233/FI-2009-0049zbMATH Open1176.68082OpenAlexW1855894008MaRDI QIDQ3634005FDOQ3634005

Authors: Igor Potapov, Alexej P. Lisitsa 

Publication date: 23 June 2009

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2009-0049

Recommendations

• Interval queries on object histories
• On the computational power of demand queries
• Content-related interval queries on object histories
• On the complexity of database queries
• Towards using the history in online computation with advice
• The complexity of higher-order queries
• From query complexity to computational complexity
• scientific article; zbMATH DE number 2036278

zbMATH Keywords

universalityexecutable temporal logichistory-dependent computationsmodels of computations

Mathematics Subject Classification ID

Temporal logic (03B44)

Cited In (3)

• Decision problems of object histories
• Counting Multiplicity over Infinite Alphabets
• Turing machines with access to history

This page was built for publication: On the Computational Power of Querying the History

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3634005)