Coinductive Models of Finite Computing Agents

Abstract This paper explores the role of coinductive methods in modeling finite interactive computing agents. The computational extension of computing agents from algorithms to interaction parallels the mathematical extension of set theory and algebra from inductive to coinductive models. Maximal fixed points are shown to play a role in models of observation that parallels minimal fixed points in inductive mathematics. The impact of interactive (coinductive) models on Church's thesis and the connection between incompleteness and greater expressiveness are examined. A final section shows that actual software systems are interactive rather than algorithmic. Coinductive models could become as important as inductive models for software technology as computer applications become increasingly interactive.

[1]  Peter Aczel,et al.  Non-well-founded sets , 1988, CSLI lecture notes series.

[2]  Ralph Johnson,et al.  design patterns elements of reusable object oriented software , 2019 .

[3]  Peter Wegner,et al.  Why interaction is more powerful than algorithms , 1997, CACM.

[4]  A. M. Turing,et al.  Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.

[5]  Gul Agha,et al.  Research directions in concurrent object-oriented programming , 1993 .

[6]  Gary James Jason,et al.  The Logic of Scientific Discovery , 1988 .

[7]  Philip E. Agre,et al.  Computational Research on Interaction and Agency , 1995, Artif. Intell..

[8]  Peter Wegner,et al.  Tradeoffs between reasoning and modeling , 1993 .

[9]  Peter Wegner.  Towards Empirical Computer Science , 1999 .

[10]  Robin Milner,et al.  Operational and Algebraic Semantics of Concurrent Processes , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[11]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[12]  Vaughan R. Pratt,et al.  Chu Spaces and Their Interpretation as Concurrent Objects , 1995, Computer Science Today.

[13]  Peter Wegner,et al.  Interactive Software Technology , 1997, The Computer Science and Engineering Handbook.

[14]  Samson Abramsky.  Semantics of Interaction (Abstract) , 1996, CAAP.

[15]  Michael P. Wellman,et al.  Planning and Control , 1991 .

[16]  D. Harrison,et al.  Vicious Circles , 1995 .

[17]  Gerhard Goos,et al.  Computer Science Today: Recent Trends and Developments , 1995 .

[18]  Renatus Ziegler,et al.  Finsler Set Theory: Platonism and Circularity , 1996 .

[19]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[20]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[21]  Saul Kripke,et al.  A completeness theorem in modal logic , 1959, Journal of Symbolic Logic.

[22]  Peter Wegner,et al.  Mathematical Models of Interactive Computing , 1999 .

[23]  Peter Wegner,et al.  Interactive , 2021, Encyclopedia of the UN Sustainable Development Goals.

[24]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[25]  A. R. D. Mathias,et al.  NON‐WELL‐FOUNDED SETS (CSLI Lecture Notes 14) , 1991 .

[26]  David Booth,et al.  Finsler set theory : platonism and circularity : translation of Paul Finsler's papers on set theory with introductory comments , 1996 .

[27]  Peter Wegner,et al.  Behavior and Expressiveness of Persistent Turing Machines , 1999 .

[28]  Luca Cardelli,et al.  On understanding types, data abstraction, and polymorphism , 1985, CSUR.

[29]  Dana S. Scott,et al.  The lattice of flow diagrams , 1971, Symposium on Semantics of Algorithmic Languages.

[30]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .