Ordinary interactive small-step algorithms, I
From MaRDI portal
Publication:5277752
DOI10.1145/1131313.1131320zbMath1367.68094OpenAlexW2142611800MaRDI QIDQ5277752
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70) General topics in the theory of algorithms (68W01)
Related Items (7)
What Is an Algorithm? ⋮ Concurrent abstract state machines ⋮ Software science view on quantum circuit algorithms ⋮ Semantics-to-Syntax Analyses of Algorithms ⋮ A Natural Axiomatization of Computability and Proof of Church's Thesis ⋮ When are Two Algorithms the Same? ⋮ What is the natural abstraction level of an algorithm?
This page was built for publication: Ordinary interactive small-step algorithms, I