首页 | 本学科首页   官方微博 | 高级检索  
     


Turing machines, transition systems, and interaction
Authors:Dina Q. Goldin   Scott A. Smolka   Paul C. Attie  Elaine L. Sonderegger  
Affiliation:a Computer Science and Engineering Department, University of Connecticut, Storrs, CT 06269, USA;b Department of Computer Science, SUNY at Stony Brook, Stony Brook, NY 11794, USA;c College of Computer Science, Northeastern University, Boston, MA 02115, USA
Abstract:This paper presents persistent Turing machines (PTMs), a new way of interpreting Turing-machine computation, based on dynamic stream semantics. A PTM is a Turing machine that performs an infinite sequence of “normal” Turing machine computations, where each such computation starts when the PTM reads an input from its input tape and ends when the PTM produces an output on its output tape. The PTM has an additional worktape, which retains its content from one computation to the next; this is what we mean by persistence.A number of results are presented for this model, including a proof that the class of PTMs is isomorphic to a general class of effective transition systems called interactive transition systems; and a proof that PTMs without persistence (amnesic PTMs) are less expressive than PTMs. As an analogue of the Church-Turing hypothesis which relates Turing machines to algorithmic computation, it is hypothesized that PTMs capture the intuitive notion of sequential interactive computation.
Keywords:Models of interactive computation   Persistent Turing machine   Persistent stream language   Interactive transition system   Sequential interactive computation
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号