A theory of interactive computation
DOI10.1007/3-540-34874-3_6zbMATH Open1266.68115OpenAlexW2096985795MaRDI QIDQ4928702FDOQ4928702
Authors: J. Van Leeuwen, Jiří Wiedermann 
Publication date: 18 June 2013
Published in: Interactive Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-34874-3_6
Recommendations
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (16)
- Title not available (Why is that?)
- Interaction and Realizability
- Verifying of interface assertions for infinite state Mealy machines
- Computability and realizability for interactive computations
- Computational complementarity
- Automata, Languages and Programming
- On the Executability of Interactive Computation
- Interactive computation: stepping stone in the pathway from classical to developmental computation
- A thesis for interaction
- How We Think of Computing Today
- Theory Is Forever
- Proceedings of the workshop on the foundations of interactive computation (FinCo 2007), Braga, Portugal, March 31, 2007
- Actors and logical analysis of interactive systems
- Programming languages for interactive computing
- Time-awareness and proactivity in models of interactive computation
- The computational power of interactive recurrent neural networks
This page was built for publication: A theory of interactive computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928702)
