Goldin D., Persistent Turing Machines as a Model of Interactive Computation, FoIKS'00, Cottbus, Germany, 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....Figure I is strictly more expres sive than the one on its left. We shall not be addressing the theoretically significant issue of whether MIMs and SIMs can be reduced to Turing Machines here. They are relegated to separate papers themselves. For more details the interested reader is refered to [3, 2, 10, 12, 15, 14]. Information systems are mostly MIMs when it comes to their interactive behavior. On the other hand, a reactive system, a single object, a single user DBMS are all SIMs. Algorithms, task sequences and function calls are TMs. It is generally agreed that reactive systems cannot be adequately ....

D. Goldin. Persistent turing machines as a model of interactive computation. In Proceedings of FolKS 2000.

....E can behave arbitrarily and unpredictably. In most results we assume that C is a program with unbounded memory, with a memory contents that is building up over time and that is never erased (unless the component explicitly does so) This compares to the use of persistent Turing machines by Goldin [4] (see also Goldin and Wegner [5] and Kosub [8] No special assumptions are made about the speed at which C and E can operate and generate responses. In sections 3 and 4 we show a number of simple results that indicate how interactive computing can lead to nonrecursive behaviour. Viewing ....

....computations in Section 6. It is realistic to assume that the initial speci cation of C is a program, written in some acceptable programming system. For example, the internal operation of C could be modeled by a persistent Turing machine of some sort (as in Wegner and Goldin [31] and Goldin [4]) In our model, the underlying program itself may evolve as well. It is easily argued that interactiveness, as a property of arbitrary component programs, is recursively undecidable, by reducing from the Halting Problem. The following stronger but still elementary statement can be observed, ....

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 (FoIKS 2000), Lecture Notes in Computer Science, vol. 1762, Springer-Verlag, Berlin, 2000, pp. 116135.

....on the problem which denition features are important for expressiveness of the model for distributed interactive systems and calculus, in particular. 3 Expressiveness of calculus: What Matters 3. 1 Innite versus Finite Currently, it appears that calculus [1820] interaction machines [2428,13] or random automata networks [12] could be considered to be the closest to a formal model for interactive distributed systems to describe their theoretical limits. Both last two models go beyond conventional Turing machine model and are based on innitary concepts an innite input tape or an ....

....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 ....

[Article contains additional citation context not shown here]

Goldin D. (2000) Persistent Turing Machines as a Model of Interactive Computation, FoIKS'00, Cottbus, Germany (also http://www.cs.umb.edu/dqg).

....precisely capture what can be computed is invalid. We note that it is not the Church Turing thesis that is questioned here but rather the notion of computation that it captures. A further discussion of Wegner s views from the viewpoint of computability theory was given in [31] see also [17] and [51] 2.3 Non uniform interactive computations The aim of the present paper is to consider the following features of modern computing in more detail: non uniformity of programs, interaction of machines, and in nity of operation. We believe that these features, seen as simultaneous ....

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 (FoIKS Jan van Leeuwen and Jir Wiedermann 2000), Lecture Notes in Computer Science, vol. 1762, Springer-Verlag, Berlin, 2000, pp. 116-135.

....Turing Machine (TM) which is a mathematical model for computable functions. Sequential interaction, as depicted in Figure 3(b) represents composition of computable functions sequentially, such that the state is persistent over computations. This is represented by Persistent Turing Machines (PTMs) [5]. PTMs provide a minimal extension to TMs by having a persistent worktape whose contents are maintained intact over multiple PTM computations. Sequential interaction is also expressed by other mathematical models like Labeled Transition Systems, Coalgebras and Transducers. Multi stream ....

D. Goldin. Persistent Turing Machines as a Model of Interactive Computation. Proc. of FoIKS 2000, Burg, Germany, Feb 2000.

No context found.

D. Goldin. Persistent Turing Machines as a Model of Interactive Computation. in: K-D. Schewe and B. Thalheim (Eds.), First Int'l Symposium (FoIKS'2000). LNCS, Vol.1762, Springer-Verlag, Berlin 2000, pp. 116-135.

No context found.

D. Goldin. Persistent Turing Machines as a Model of Interactive Computation. in: K-D. Schewe and B. Thalheim (Eds.), First Int'l Symposium (FoIKS'2000). LNCS, Vol.1762, Springer-Verlag, Berlin 2000, pp. 116-135.

No context found.

Dina Goldin. Persistent Turing Machines as a Model of Interactive Computation. FoIKS'00, Cottbus, Germany, Feb. 2000.

....systems, by [Mi1] in the context of process models, and by [We3] in the context of interaction machines. This approach in [We3] differs from related work by focusing on models of interaction and notions of expressiveness that are language independent as well as domain independent. Subsequent work [WG2, WG3, Go], has led to the development of persistent Turing machines (PTMs) as a canonical model of sequential computation, of an expressiveness hierarchy for sequential computation, and of the result that multi stream interaction machines (MIMs) are more expressive than sequential interaction machines ....

Dina Goldin, Persistent Turing Machines as a Model of Interactive Computation, FoIKS'00, Cottbus, Germany, Feb. 2000.

....is absent. However, persistency can be captured in dataflow models by feedback loops and in process calculi by explicitly modeling the data store. Persistent Turing machines, and the closely related Sequential Interaction Machines, have been introduced in earlier papers by Wegner and Goldin [Weg96, Weg97, Weg98, WG99, GST00, Gol00]. A major emphasis of this body of work is to show how such a computational framework can be used as a basis for modeling various forms of interactive computing, such as object oriented, agent based, dynamical systems, and others. An alternative approach to extending the Turing machine model to ....

D. Goldin. Persistent Turing machines as a model of interactive computation. In Proceedings of FoIKS 2000, Burg, Germany, February 2000.

....which entails considerations that span the life cycle of the larger system. Services are interactive in nature, involving user sessions with one or more users. Services over time which are specified by models of interaction, are not reducible to or expressible by algorithms or Turing machines [9, 32, 34]. Since models of interaction are a new area of research, it is not surprising that there have been no principles of information systems until now. The distinction between a database that manages data and answers queries, versus an information system that provides services, is schematically ....

....database consistency. On the other hand, an information system provides database backed services to its user community. Its computation is interactive, with the dynamically generated streams of user requests serving as input, and the corresponding feedback to the users serving as output [9]. IS computation: an interactive transduction of one or more autonomous input streams of user requests into output streams of system feedback, accompanied by an evolving system state Note that the input consists of all the user requests, throughout the lifetime of the system, and not of single ....

[Article contains additional citation context not shown here]

Dina Goldin. Persistent Turing Machines as a Model of Interactive Computation. Proceedings of the FoIKS 2000, Burg, Germany, Feb 2000.

....there exists a homomorphism between any 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. ....

....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 abstractions are an important part of their formalization. [Gol] laid the foundations for formalizing the notion of PTMs, starting with the notions of PTM equivalence and expressiveness. However, the question of minimal PTMs has not been addressed until now. PTMs can be viewed as effective infinite state transducers over infinite sets of input and output ....

[Article contains additional citation context not shown here]

Dina Goldin. Persistent Turing Machines as a Model of Interactive Computation. Accepted to FoIKS'00, Cottbus, Germany, Feb. 2000.

No context found.

Goldin D., Persistent Turing Machines as a Model of Interactive Computation, FoIKS'00, Cottbus, Germany, 2000.

No context found.

Goldin D., Persistent Turing Machines as a Model of Interactive Computation, FoIKS'00, Cottbus, Germany, 2000.

No context found.

Goldin, G. Persistent Turing Machines as a Model of Interactive Computation. Proc. of FoIKS 2000. Burg (Spreewald), Germany (2000).

No context found.

Dina Goldin. Persistent Turing Machines as a Model of Interactive Computation. Proceedings of the FoIKS 2000.

No context found.

Goldin D., Persistent Turing Machines as a Model of Interactive Computation, FoIKS'00, Cottbus, Germany, 2000.

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