Turing machines, transition systems, and interaction

DOI10.1016/j.ic.2004.07.002zbMath1090.68040OpenAlexW2048671682MaRDI QIDQ703844

Paul C. Attie, Dina Q. Goldin, Scott A. Smolka, Elaine L. Sonderegger

Publication date: 11 January 2005

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2004.07.002

zbMATH Keywords

Interactive transition systemModels of interactive computationPersistent stream languagePersistent Turing machineSequential interactive computation

Mathematics Subject Classification ID

Related Items (16)

On the computing power of fuzzy Turing machines ⋮ The Computational Power of Interactive Recurrent Neural Networks ⋮ Reactive Turing machines ⋮ Question answering by humans and machines: a complexity-theoretic view ⋮ How We Think of Computing Today ⋮ ``Viral Turing machines, computation from noise and combinatorial hierarchies ⋮ Information systems in modeling interactive computations on granules ⋮ Verifying of interface assertions for infinite state Mealy machines ⋮ Automata theory based on complete residuated lattice-valued logic: Turing machines ⋮ Expressive power of first-order recurrent neural networks determined by their attractor dynamics ⋮ Reactive Turing Machines ⋮ A thesis for interaction ⋮ CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions ⋮ Computability and realizability for interactive computations ⋮ A Formal Framework for Interactive Agents ⋮ Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages

Uses Software

• Esterel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Higher-level synchronising devices in Meije-SCCS
• On the consistency of Koomen's fair abstraction rule
• Statecharts: a visual formalism for complex systems
• Recognizing safety and liveness
• Interactive foundations of computing
• The Esterel synchronous programming language: Design, semantics, implementation
• A calculus of mobile processes. II
• Concrete domains
• Sequentiality in an extensional framework
• Fast on-line integer multiplication
• Forward and backward simulations. I. Untimed Systems
• Proving the Correctness of Multiprocess Programs
• Why Church's Thesis Still Holds. Some Notes on Peter Wegner's Tracts on Interaction and Computability
• Foundations of Cryptography
• Bisimulation can't be traced
• Programming as a Discipline of Mathematical Nature
• Turing Machines, Transition Systems, and Interaction
• Online Algorithms
• What is in a step: On the semantics of statecharts
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: Turing machines, transition systems, and interaction