D. Goldin and P. Wegner. Persistence as a form of interaction. Technical Report CS-98-07, Brown University, 1998. 81  Home/Search   Document Details and Download   Summary   Related Articles   Check

....to implicitly announce events when a function is called or a method is invoked. Doing this would allow interested clients to keep track of, for example, all the methods of an object that are invoked and, using that invocation history, reconstruct the abstract value of the Abstract Data Type (ADT) GW98] The advantage to this approach over other approaches is that the state of the ADT could be monitored despite the fact that the ADT provides no direct support for such monitoring. Of course, use of implicit announcement for a function call or method invocation assumes that there is a suciently ....

D. Goldin and P. Wegner. Persistence as a form of interaction. Technical Report CS-98-07, Brown University, 1998. 81

....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 and P. Wegner. Persistence as a Form of Interaction. Brown University Technical Report, 1998.

.... 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 components as interactive transducers ....

D. Goldin, P. Wegner. Persistence as a form of interaction, Techn. Rep. CS-98-07, Dept. of Computer Science, Brown University, Providence, RI, 1998.

.... Computations Sven Kosub Theoretische Informatik, Universitat Wurzburg Am Exerzierplatz 3, D 97072 Wurzburg Email: kosub informatik.uni wuerzburg.de December 22, 1998 Abstract We study computational effects of persistent Turing machines, independently introduced by Goldin and Wegner [GW98], and Kosub [Kos98] Persistence is a mode of interaction which makes it possible to consider the computational behavior of a Turing machine as an infinite sequence of autonomous computations. We investigate different computability concepts such as conditional and essential computability. ....

....semantics of a Turing machine. This is why we can speak about persistence as the simplest mode of interaction; we do not need to change the model, we only look at computations interactively. The notion of the persistent Turing machine examined here was independently defined by Goldin and Wegner [GW98], and under a different name by Kosub [Kos98] All the results mentioned below are contained in the latter work. Persistence is inherently chronologic. The behavior of a persistent machine at the current input the local behavior depends heavily on all its preceding inputs typically in ....

[Article contains additional citation context not shown here]

D. Goldin and P. Wegner. Persistence as a form of interaction. Technical Report CS-98-07, Brown University, Department of Computer Science, 1998.

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