Ordinary interactive small-step algorithms. I
From MaRDI portal
Publication:5277752
DOI10.1145/1131313.1131320zbMATH Open1367.68094OpenAlexW2142611800MaRDI QIDQ5277752FDOQ5277752
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/1131313.1131320
Recommendations
- Ordinary interactive small-step algorithms, II
- Ordinary interactive small-step algorithms, III
- Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem
- Interactive Small-Step Algorithms I: Axiomatization
- Abstract State Machines 2004. Advances in Theory and Practice
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70) General topics in the theory of algorithms (68W01)
Cited In (16)
- Semantics-to-Syntax Analyses of Algorithms
- When are Two Algorithms the Same?
- What is the natural abstraction level of an algorithm?
- Abstract State Machines 2004. Advances in Theory and Practice
- Software science view on quantum circuit algorithms
- Persistent queries in the behavioral theory of algorithms
- Concurrent abstract state machines
- Ordinary interactive small-step algorithms, II
- Ordinary interactive small-step algorithms, III
- Interactive Small-Step Algorithms I: Axiomatization
- Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem
- Title not available (Why is that?)
- Interactive Algorithms 2005 with Added Appendix
- Mathematical Foundations of Computer Science 2005
- A Natural Axiomatization of Computability and Proof of Church's Thesis
- What is an algorithm?
This page was built for publication: Ordinary interactive small-step algorithms. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5277752)
