Persistent queries in the behavioral theory of algorithms

DOI10.1145/1877714.1877722MaRDI QIDQ2946634zbMATH OpenOpenAlexFDO

Authors Andreas Blass, Yuri Gurevich

Publication date 17 September 2015

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1877714.1877722

zbMATH Keywords

abstract state machinesinteractive algorithmssequential algorithmssmall-step algorithmsstep-for-step simulation

Mathematics Subject Classification ID

General topics in the theory of algorithms (68W01)

Recommendations

• Ordinary interactive small-step algorithms. I
• Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem
• Ordinary interactive small-step algorithms, III
• Interactive Small-Step Algorithms I: Axiomatization
• Ordinary interactive small-step algorithms, II

Cited in

(2)

• What is the natural abstraction level of an algorithm?
• ASPECTS OF PERSISTENT COMPUTATIONS

This page was built for publication: Persistent queries in the behavioral theory of algorithms

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