On algorithms and interaction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1893, Issue , 2000, Pages 99-113

  Van Leeuwen, Jan ^a   Wiedermann, Jiří ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

BEHAVIOR CHANGE; CHURCH-TURING THESIS; COMPUTABLE FUNCTIONS; GENERIC MODELING; INPUT AND OUTPUTS; IT SYSTEM; MACHINE MODELS; UNPREDICTABLE ENVIRONMENTS;

ALGORITHMS;

EID: 84959214611     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44612-5_7     Document Type: Conference Paper

References (30)

1. M. Broy. A logical basis for modular software and systems engineering, in: B. Rovan (Ed.), SOFSEM'98: Theory and Practice of Informatics, Proc. 25th Conference on Current Trends, Lecture Notes in Computer Science, Vol. 1521, Springer-Verlag, Berlin, 1998, pp. 19-35.
2. R.S. Cohen, A.Y. Gold. w-Computations on Turing machines, Theor. Comput. Sci. 6 (1978) 1-23.
3. J. Engelfriet, H.J. Hoogeboom. X-automata on w-words, Theor. Comput. Sci. 110 (1993) 1-51.
4. D.Q. Goldin. Persistent Turing machines as a model of interactive computation, in: K-D. Schewe and B. Thalheim (Eds.), Foundations of Information and Knowledge Systems, Proc. First Int. Symposium (FolKS 2000), Lecture Notes in Computer Science, vol. 1762, Springer-Verlag, Berlin, 2000, pp. 116-135.
5. D. Goldin, P. Wegner. Persistence as a form of interaction, Techn. Rep. CS-98-07, Dept. of Computer Science, Brown University, Providence, RI, 1998.
6. D. Konig. Sur les correspondances multivoques des ensembles, Fundam. Math. 8 (1926) 114-134.
7. D. Konig. Uber eine Schlussweise aus dem Endlichen ins Unendliche (Punktmen-gen. - Kartenfarben. — Verwantschaftsbeziehungen. - Schachspiel), Acta Litt. Sci. (Sectio Sci. Math.) 3 (1927) 121-130.
8. S. Kosub. Persistent computations, Technical Report No. 217, Institut faur Informatik, Julius-Maximilians-Universitaat Wuarzburg, 1998.
9. Z. Manna, A. Pnueli. Models for reactivity, Acta Informatica 30 (1993) 609-678.
10. R. Milner. A calculus of communicating systems, Lecture Notes in Computer Science, Vol. 92, Springer-Verlag, Berlin, 1980.
11. R. Milner. Elements of interaction, C.ACM 36:1 (1993) 78-89.
12. A. Pnueli. Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends, in: J.W. de Bakker, W.-P. de Roever and G. Rozenberg, Current Trends in Concurrency, Lecture Notes in Computer Science, Vol. 224, Springer-Verlag, Berlin, 1986, pp. 510-585.
13. A. Pnueli. Specification and development of reactive systems, in: H.-J. Kugler (Ed.), Information Processing 86, Proceedings IFIP 10th World Computer Congress, Elsevier Science Publishers (North-Holland), Amsterdam, 1986, pp. 845-858.
14. M. Prasse, P. Rittgen. Why Church's Thesis still holds. Some notes on Peter Weg-ner's tracts on interaction and computability, The Computer Journal 41 (1998) 357-362.
15. L. Staiger. w-Languages, in: G. Rozenberg and A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 3: Beyond Words, Chapter 6, Springer-Verlag, Berlin, 1997, pp. 339-387.
16. W. Thomas. Automata on infinite objects, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. B: Models and Semantics, Elsevier Science Publishers, Amsterdam, 1990, pp. 135-191.
17. W. Thomas. Languages, automata, and logic, in: G. Rozenberg and A. Salomaa (Eds.), Handbook ofFormal Languages, Vol. 3: Beyond Words, Chapter 7, Springer- Verlag, Berlin, 1997, pp. 389-455.
18. B.A. Trakhtenbrot. Automata and their interaction: definitional suggestions, in: G. Ciobanu and G. Paun (Eds.), Fundamentals of Computation Theory, Proc. 12th International Symposium (FCT'99), Lecture Notes in Computer Science, Vol. 1684, Springer-Verlag, Berlin, 1999, pp. 54-89.
19. J. van Leeuwen, J. Wiedermann. A computational model of interaction, Technical Report, Dept of Computer Science, Utrecht University, Utrecht, 2000.
20. J. van Leeuwen, J. Wiedermann. Breaking the Turing barrier: the case of the Internet, Technical Report, Inst. of Computer Science, Academy of Sciences, Prague, 2000.
21. J. van Leeuwen, J. Wiedermann. Extending the Turing Machine Paradigm, in: B. Engquist and W. Schmidt (Eds.), Mathematics Unlimited - 2001 and Beyond, Springer-Verlag, Berlin, 2000 (to appear).
22. K. Wagner, L. Staiger. Recursive w-languages, in: M. Karpinsky (Ed.), Fundamentals of Computation Theory, Proc. 1977 Int. FCT-Conference, Lecture Notes in Computer Science, Vol. 56, Springer-Verlag, Berlin, 1977, pp. 532-537.
23. P. Wegner. Interactive foundations of object-based programming, IEEE Computer 28:10 (1995) 70-72.
24. P. Wegner. Interaction as a basis for empirical computer science, Comput. Surv. 27 (1995) 45-48.
25. P. Wegner. Why interaction is more powerful than algorithms, C.ACM 40 (1997) 80-91.
26. P. Wegner. Interactive foundations of computing, Theor. Comp. Sci. 192 (1998) 315-351.
27. P. Wegner, D. Goldin. Co-inductive models of finite computing agents, in: B. Jacobs and J. Rutten (Eds.), CMCS'99-Coalgebraic Methods in Computer Science, TCS: Electronic Notes in Theoretical Computer Science, Vol. 19, Elsevier, 1999.
28. P. Wegner, D. Goldin. Interaction as a framework for modeling, in: P. Chen et al. (Eds.), Conceptual Modeling - Current Issues and Future Directions, Lecture Notes in Computer Science, Vol. 1565, Springer-Verlag, Berlin, 1999, pp 243-257.
29. P. Wegner, D.Q. Goldin. Interaction, computability, and Church's thesis, The Computer Journal 1999 (to appear).
30. G. Winskel. The formal semantics ofprogramming languages: an introduction, The MIT Press, Cambridge (Mass.), 1993.