Persistent Turing machines as a model of interactive computation
From MaRDI portal
Recommendations
Cited in
(10)- Interactive foundations of computing
- ``Viral Turing machines, computation from noise and combinatorial hierarchies
- The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
- Question answering by humans and machines: a complexity-theoretic view
- On the executability of interactive computation
- ASPECTS OF PERSISTENT COMPUTATIONS
- Turing machines, transition systems, and interaction
- A theory of interactive computation
- Interaction and Realizability
- Turing machines, transition systems, and interaction
This page was built for publication: Persistent Turing machines as a model of interactive computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4504007)