Formalizing the notions of non-interactive and interactive algorithms

DOI10.47743/SACS.2025.2.211MaRDI QIDQ6869865zbMATH OpenFDO

Authors C. A. Middelburg

Publication date 21 January 2026

Published in Scientific Annals of Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.47743/SACS.2025.2.211

zbMATH Keywords

algorithmic equivalencecomputational equivalenceinteractive algorithmnon-interactive algorithmnondeterminismprotoalgorithm

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• Computability and realizability for interactive computations
• scientific article; zbMATH DE number 46957 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 2080910 (Why is no real title available?)
• scientific article; zbMATH DE number 3241254 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3315195 (Why is no real title available?)
• Modifications of the program scheme model
• Nondeterministic Algorithms
• Ordinary interactive small-step algorithms. I
• Reactive Turing machines
• Turing machines, transition systems, and interaction

Cited in

(1)

• On the formalization of the notion of a concurrent algorithm

This page was built for publication: Formalizing the notions of non-interactive and interactive algorithms

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