Current trends in concurrency. Overviews and tutorials
Handbook of theoretical computer science (vol. B)
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
Elements of interaction: Turing award lecture
Communications of the ACM
Theoretical Computer Science
Interaction as a basis for empirical computer science
ACM Computing Surveys (CSUR)
Why interaction is more powerful than algorithms
Communications of the ACM
Handbook of formal languages, vol. 3
Languages, automata, and logic
Handbook of formal languages, vol. 3
Interactive foundations of computing
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
A Calculus of Communicating Systems
A Calculus of Communicating Systems
A Logical Basis for Modular Software and Systems Engineering
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Persistence as a Form of Interaction
Persistence as a Form of Interaction
Emergence of a Super-Turing Computational Potential in Artificial Living Systems
ECAL '01 Proceedings of the 6th European Conference on Advances in Artificial Life
Beyond the Turing Limit: Evolving Interactive Systems
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
| Hi-index | 0.00 |
Many IT-systems behave very differently from classical machine models: they interact with an unpredictable environment, they never terminate, and their behavior changes over time. Wegner [25,26] (see also [28]) recently argued that the power of interaction goes beyond the Church-Turing thesis. To explore interaction from a computational viewpoint, we describe a generic model of an 'interactive machine' which interacts with the environment using single streams of input and output signals over a simple alphabet. The model uses ingredients from the theory of ω-automata. Viewing the interactive machines as transducers of infinite streams of signals, we show that their interactive recognition and generation capabilities are identical. It is also shown that, in the given model, all interactively computable functions are limit-continuous.