Abstract
The irreducibility of interactive to algorithmic computing requires fundamental questions concerning models of computation to be reexamined. This paper reviews single-stream and multiple-stream interaction machines, extensions of set theory and algebra for models of sequential interaction, and interactive extensions of the Turing test. It motivates the use of interactive models as a basis for applications to computer architecture, software engineering, and artificial intelligence.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Peter Aczel, Non Well-Founded Sets, CSLI Lecture Notes #14, Stanford, 1988.
Isiah Berlin, The Proper Study of Mankind, anthology edited by Henry Hardy and Roger Hausheer, Farrar, Straus, and Giroux, 1997.
Jon Barwise and Lawrence Moss, Vicious Circles, CSLI Lecture Notes #60, Cambridge University Press, 1996.
Peter Chen, The Entity Relationship Model: Towards a Unified View of Data, Transactions on Database Systems, 1976.
Paul Finsler, Finsler Set Theory: Platonism and Circularity, Ed David Booth and Renatus Ziegler, Birkhauser, 1996.
Daniel Goleman, Emotional Intelligence, Bantam paperback, 1997.
Haim Kilov and James Ross, Information Modeling: An Object-Oriented Approach, Prentice Hall, 1994.
Robin Milner, Operational and Algebraic Semantics of Concurrent Processes, Handbook of Theoretical Computer Science, J. van Leeuwen, editor, Elsevier, 1990.
Zohar Manna and Amir Pnueli, The Temporal Logic of Reactive and Concurrent Systems, Springer Verlag, 1992.
Roger Penrose, The Emperor’s New Mind, Oxford, 1989.
Vaughan Pratt, Chu Spaces and their Interpretation as Concurrent Objects, in Computer Science Today: Recent Trends and Developments, Ed. Jan van Leeuwen, LNCS #1000, 1995.
Jan Rutten, A Tutorial on Coalgebras and Coinduction, EATCS Bulletin 62, 1997.
John Searle, Minds, Brains, and Programs, The Behavioral and Brain Sciences, 1980.
Alan Turing, On Computable Numbers with an Application to the Entscheidungsproblem, Proc. London Math Soc., 2:42, pp. 230–265, 1936.
Alan Turing, Systems of Logic Based on Ordinals, Proc. London Math. Soc., 1939.
Alan Turing, Computing Machinery and Intelligence, Mind, 1950.
Peter Wegner, Why Interaction is More Powerful Than Algorithms, CACM, May 1997.
Peter Wegner, Interactive Foundations of Computing, Theoretical Computer Science, Feb. 1998
Peter Wegner, Towards Empirical Computer Science, The Monist, Issue on the Philosophy of Computation, Spring 1999, available at http://www.cs.brown.edu/people/pw
Peter Wegner, Interactive Software Technology, Handbook of Computer Science and Engineering,CRC Press, December 1996.
Peter Wegner, Tradeoffs Between Reasoning and Modeling, in Research Directions in Concurrent Object-Oriented Programming, Eds. Agha, Wegner, Yonezawa, MIT Press 1993.
Peter Wegner and Dina Goldin, Mathematical Models of Interactive Computing, www.cs.brown.edu/people/pw, December 1998.
Stanley Zdonik and David Maier, Readings in Object-Oriented Database Systems, Morgan Kaufmann, 1990
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wegner, P., Goldin, D. (1999). Interaction as a Framework for Modeling. In: Goos, G., et al. Conceptual Modeling. Lecture Notes in Computer Science, vol 1565. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48854-5_19
Download citation
DOI: https://doi.org/10.1007/3-540-48854-5_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65926-6
Online ISBN: 978-3-540-48854-5
eBook Packages: Springer Book Archive