OpenAlex
Turing Machines, Transition Systems, and Interaction
Work
Year: 2002
Type: article
Abstract: We present Persistent Turing Machines (PTMs), a new way of interpreting Turing-machine computation, one that is both interactive and persistent. We show that the class of PTMs is isomorphic to a very ... more
Source: Electronic Notes in Theoretical Computer Science
Authors Dina Goldin, Scott A. Smolka, Peter Wegner
Institutions University of Connecticut, Stony Brook University, Brown University
Cites: 35
Cited by: 20
Related to: 10
FWCI: 2.605
Citation percentile (by year/subfield): 86.97
Topic: Distributed systems and fault tolerance
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold