Wegner P., Goldin D. (1999) Coinductive Models of Finite Computing Agents, Electronic Notes in Theoretical Computer Science, vol.19.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....with illustrating examples trying to achieve a more moderate goal, i.e. showing that in calculus we can encode calculus and calculus. Next we will show that calculus can express formalisms which have richer behavior than Turing machines: including cellular automata [1] interaction machines [24,25,27,28,13], neural networks, and automata networks [12] exactly due to allowing innite (but enumerable) application of the parallel composition operator. Example 31 Encoding of the calculus Because calculus is higher order, encoding of calculus is straightforward: Expressiveness of Calculus: What ....

....number of parallel or sequential compositions, choices) The same applies to the number of send receive pairs involved in communication. Thus we can conclude that MIM C. The above conjecture cannot be proved at this moment, because the formalization of MIMs is subject of current research [27,28,13]. Intuitively, it seems be probable, because calculus allows for simultanenous interactions, transmission can be either synchronous or asynchronous, and channels because of polyadic features of calculus can be either broadcasting multicasting (not a single, but a vector of expressions can 8 ....

[Article contains additional citation context not shown here]

Wegner P., Goldin D. (1999) Coinductive Models of Finite Computing Agents, Electronic Notes in Theoretical Computer Science, vol.19 (also http://www.cs.umb.edu/dqg).

....ine his her own cost metrics. Send, mutation and receive are used for handshaking message passing communication, but also for inferencing. The indexing set I must be inf inite to express formalisms with richer behavior than Turing machines: including cellular automata [4] interaction machines [31, 32, 33], neural networks, and random automata networks [14] This expressive power is needed to express construction universality, selfreproduction, and evolution problems. 13] shows calculus simulates calculus, calculus, interaction machines, cellular automata, neural networks and random automata ....

Wegner P., Goldin D., Coinductive Models of Finite Computing Agents, Electronic Notes in Theoretical Computer Science, vol.19, 1999 (also http://www.cs.umb.edu/dqg).

....deliberative and reactive approaches for action selection in real time, and allowing to capture bounded optimization and metareasoning in distributed interactive AI systems. To its formal roots belong Milner s calculus [15, 16] basic theory of concurrency) and Wegner s interaction machines [20, 21, 22] (interactive agent model) Regarding expressiveness it can express formalisms having richer behaviors than Turing Machines, including calculus, cellular automata, interaction machines, neural nets, and random automata networks [6] calculus leads to a new programming paradigm (cost languages) ....

Wegner P., Goldin D., Coinductive Models of Finite Computing Agents, Electronic Notes in Theoretical Computer Science, vol.19, 1999.

....At the same time, relatively simple features and restrictions are imposed on the agents themselves. The environment is also simple a small number of resources is provided without spatial distribution. The theoretical motivation for this approach is taken from formal models of interaction (Wegner and Goldin 2000). We speculate that persistence of life (and also biological memory) is first of all conditioned by the form of interaction of agents with the abiotic world and that the type of interaction can be studied in an abstract manner by AL simulations. A related approach with a different notion of ....

Wegner, P. and Goldin, D. (2000): Coinductive Models of Finite Computing Agents. Electronic Notes in Theoretical Computer Science 19, 21.

.... a persistent worktape preserved between successive interactions; they are a minimal extension of Turing machines (TMs) that express interactive behavior [GW] They model services over time provided by embedded, object oriented, or reactive systems that cannot be expressed by computable functions [MP, We2, WG]. TMs and PTMs are abstract computing devices useful for representing different forms of computational behavior: TMs model algorithmic behavior whereas PTMs model sequential interactive behavior (SIMs) WG] In general, sequential interactive behavior may involve aspects that are not modeled by ....

.... or reactive systems that cannot be expressed by computable functions [MP, We2, WG] TMs and PTMs are abstract computing devices useful for representing different forms of computational behavior: TMs model algorithmic behavior whereas PTMs model sequential interactive behavior (SIMs) [WG]. In general, sequential interactive behavior may involve aspects that are not modeled by PTMs, with temporal or non discrete characteristics; these characteristics may be crucial, as in the case of embedded devices. PTMs share with TMs the inability to express temporal or non discrete ....

[Article contains additional citation context not shown here]

Peter Wegner, Dina Goldin, Coinductive Models of Finite Computing Agents, Proc. Coalgebra Workshop (CMCS `99), Electronic Notes in Theoretical Computer Science, Vol. 19, March 1999.

No context found.

Wegner P., Goldin D. (1999) Coinductive Models of Finite Computing Agents, Electronic Notes in Theoretical Computer Science, vol.19.

....the modeled domain but by the same token restricts expressiveness. We may wish to model classes of systems (mathematical, computational, or physical) which have a non RE set of properties. Modeling is observational rather than constructive, based on greatest fixpoints rather than least fixpoints [WG99]. The gap between least and greatest fixpoint semantics is also the gap between operational (algorithm) and denotational (observation) semantics. It is also the same as the gap between deduction and abduction. Greatest fixpoints allow us to define larger domains. Lacking a constructive ....

Peter Wegner and Dina Goldin. Coinductive Models of Finite Computing Agents. Proc. Coalgebra Workshop (CMCS '99). Electronic Notes in Theoretical Computer Science, Volume 19, March 1999.

....outputs are dynamically generated streams of tokens (strings) GW] They are a minimal extension of Turing Machines (TMs) that express interactive behavior. They model services over time provided by persistent, object oriented, or reactive systems that cannot be expressed by computable functions [MP,We2,WG2,WG3]. They also provide a natural model for single user databases, where the current database instance is modeled as the contents of the persistent worktape. TMs and PTMs are abstract computing devices useful for representing different forms of computational behavior: TMs model algorithmic behavior, ....

....processes, whose expressiveness requires the full generality of SIMs. Furthermore, there are multistream interactive behaviors, such as distributed database systems or airline reservation systems, which cannot be modeled by SIMs at all, requiring a model with even more expressiveness MIMs [WG2,WG3]. We expect that PTM based models of computation can be generalized to model all sequential computation. We believe that a proper formalization of the notion of a PTM environment will be an important part of this effort. Though there is no Silver Bullet in the absolute sense, the problems of ....

[Article contains additional citation context not shown here]

Peter Wegner, Dina Goldin. Coinductive Models of Finite Computing Agents, Proc. Coalgebra Workshop (CMCS'99), ENTCS, Vol. 19, March 1999.

No context found.

Peter Wegner, Dina Goldin. Coinductive Models of Finite Computing Agents. Electronic Notes in Theoretical Computer Science, Vol 19, Elsevier, 1999.

....PTM and its minimal form, and that all equivalent minimal PTMs are isomorphic. Minimal PTMs can be represented by final coalgebras, confirming the coinductive nature of the foundations of interactive computing. 1 Introduction Persistent Turing Machines [Gol] are Sequential Interaction Machines [WG1] that provide simple Turing Machine based operational semantics for interactive computing entities such as objects, intelligent agents, and feedback mechanisms. They model computation as a process, in a way that cannot be captured by Turing Machines. Minimal, or canonical, versions of various ....

.... This paper can be viewed as an application of these approaches to Persistent Turing Machines (PTMs) bringing together several separate threads to further formalize interactive models of computation: coalgebraic theory [BM, Ru, Jac1] transducer theory [Ne, Mo, Har, Hol] interaction [Mi, WG2, WG1, Gol] Overview Section 2 provides a background discussion about state machines, interactive devices, and Persistent Turing Machines. Section 3 defines formally the PTM model, and discusses the notions of equivalence and expressiveness for PTMs. In Section 4.2, we define the minimization of PTMs, by ....

[Article contains additional citation context not shown here]

Peter Wegner, Dina Goldin. Coinductive Models of Finite Computing Agents. ENTCS Bulletin, March 1999.

No context found.

Wegner P., Goldin D., Coinductive Models of Finite Computing Agents, Electronic Notes in Theoretical Computer Science, vol.19, 1999.

No context found.

Wegner, P., Goldin, D. Coinductive Models of Finite Computing Agents. Electronic Notes in Theoretical Computer Science. 19 Elsevier (1999).

No context found.

Peter Wegner, Dina Goldin. Coinductive Models of Finite Computing Agents. Electronic Notes in Theoretical Computer Science, Vol 19, Elsevier, 1999. 14

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC