Ordinary interactive small-step algorithms. I
From MaRDI portal
Publication:5277752
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
Cited in
(16)- Software science view on quantum circuit algorithms
- What is the natural abstraction level of an algorithm?
- Persistent queries in the behavioral theory of algorithms
- Interactive Algorithms 2005 with Added Appendix
- What is an algorithm?
- Abstract State Machines 2004. Advances in Theory and Practice
- Mathematical Foundations of Computer Science 2005
- scientific article; zbMATH DE number 1820018 (Why is no real title available?)
- A Natural Axiomatization of Computability and Proof of Church's Thesis
- Concurrent abstract state machines
- Semantics-to-Syntax Analyses of Algorithms
- When are Two Algorithms the Same?
- Interactive Small-Step Algorithms I: Axiomatization
- Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem
- Ordinary interactive small-step algorithms, II
- Ordinary interactive small-step algorithms, III
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)