Ordinary interactive small-step algorithms, II

DOI10.1145/1243996.1243998MaRDI QIDQ5277780zbMATH OpenOpenAlexFDO

Authors Andreas Blass, Yuri Gurevich

Publication date 12 July 2017

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

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

zbMATH Keywords

interactionabstract state machinespostulatessequential algorithmsequivalence of algorithms

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70) General topics in the theory of algorithms (68W01)

Recommendations

• Ordinary interactive small-step algorithms, III
• Ordinary interactive small-step algorithms. I
• Interactive Small-Step Algorithms I: Axiomatization
• Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem
• scientific article; zbMATH DE number 5051710
• Mathematical Foundations of Computer Science 2005
• Interactive Algorithms 2005 with Added Appendix
• A unified set of single step algorithms. Part 2: Theory
• On a second-order step-size algorithm
• scientific article; zbMATH DE number 1200178

Cited in

(10)

• Semantic essence of AsmL
• Abstract State Machines 2004. Advances in Theory and Practice
• Concurrent abstract state machines
• Persistent queries in the behavioral theory of algorithms
• Ordinary interactive small-step algorithms, III
• Interactive Small-Step Algorithms I: Axiomatization
• Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem
• Interactive Algorithms 2005 with Added Appendix
• Study of stepwise simulation between ASM
• Ordinary interactive small-step algorithms. I

This page was built for publication: Ordinary interactive small-step algorithms, II

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