Turing Machines, Transition Systems, and Interaction

No abstract is available for this paper.

• Publication year

  2002

• Venue

  International Workshop on Expressiveness in Concurrency

• Publication date

  2002-02-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/S1571-0661(04)00220-8
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Modeling indirect interaction in open computational systems

  2003cited by this paper
• Alan Turing: Life and Legacy of a Great Thinker

  2003cited by this paper
• The Turing machine paradigm in contemporary computing

  2001cited by this paper
• Mathematics unlimited - 2001 and beyond

  2001cited by this paper
• A computational model of interaction in embedded systems

  2001cited by this paper
• Verification on Infinite Structures

  2001cited by this paper
• The Foundations of Cryptography - Volume 1: Basic Techniques

  2001cited by this paper
• Handbook of Process Algebra

  2001cited by this paper
• Persistent Turing Machines as a Model of Interactive Computation

  2000cited by this paper
• Millenial Perspectives in Computer Science

  2000cited by this paper
• Concurrent Interaction Games

  2000cited by this paper
• Foundations of Cryptography: Basic Tools

  2000cited by this paper
• Information Systems = Databases + Interaction: Towards Principles of Information System Design

  2000cited by this paper
• On Algorithms and Interaction

  2000cited by this paper
• Efficient Algorithms for Model Checking Pushdown Systems

  2000cited by this paper
• IS=DBS+Interaction: Towards Principles of Information System Design

  2000cited by this paper
• Coinductive Models of Finite Computing Agents

  1999cited by this paper
• Persistence as a Form of Interaction

  1998cited by this paper
• Interactive Foundations of Computing

  1998cited by this paper
• Why Church's Thesis Still Holds. Some Notes on Peter Wegner's Tracts on Interaction and Computability

  1998cited by this paper
• Persistent Computations

  1998cited by this paper
• Interaction as a Framework for Modeling

  1997cited by this paper
• Why interaction is more powerful than algorithms

  1997cited by this paper
• Interactive Software Technology

  1997cited by this paper
• Reactive Modules

  1996cited by this paper
• Distributed Algorithms

  1996cited by this paper
• Vicious Circles

  1995cited by this paper
• Bisimulation can't be traced

  1995cited by this paper
• Forward and Backward Simulations: I. Untimed Systems

  1995cited by this paper
• Sequentiality in an Extensional Framework

  1994cited by this paper
• Concrete Domains

  1993cited by this paper
• Expressiveness results for process algebras

  1993cited by this paper
• Forward and Backward Simulations Part I : Untimed Systems

  1993cited by this paper
• Elements of interaction: Turing award lecture

  1993cited by this paper
• Dynamic algorithms in computational geometry

  1992cited by this paper
• The Esterel Synchronous Programming Language: Design, Semantics, Implementation

  1992cited by this paper
• A Calculus of Mobile Processes, II

  1992cited by this paper
• The Temporal Logic of Reactive and Concurrent Systems

  1991cited by this paper
• What is in a Step: On the Semantics of Statecharts

  1991cited by this paper
• Concurrency and Computability

  1990cited by this paper
• Stability and Sequentiality in Dataflow Networks

  1990cited by this paper
• Communication among Relations (Extended Abstract)

  1990cited by this paper
• Semantics of systems of concurrent processes : LITP Spring School on Theoretical Computer Science, La Roche Posay, France, April 23-27, 1990, proceedings

  1990cited by this paper
• Automata, Languages and Programming

  1990cited by this paper
• Communication and concurrency

  1989cited by this paper
• Concurrent constraint programming

  1989cited by this paper
• Logics and Models of Concurrent Systems

  1989cited by this paper
• Notes on Algebraic Calculi of Processes

  1989cited by this paper
• An Introduction to Automata Theory

  1988cited by this paper
• Computations, Residuals, and the POwer of Indeterminancy

  1988cited by this paper
• On the Consistency of Koomen's Fair Abstraction Rule

  1987cited by this paper
• Statecharts: A Visual Formalism for Complex Systems

  1987cited by this paper
• Higher-Level Synchronising Devices in Meije-SCCS

  1985cited by this paper
• Introduction to Automata Theory, Languages and Computation

  1979cited by this paper
• Coroutines and Networks of Parallel Processes

  1977cited by this paper
• Proving the Correctness of Multiprocess Programs

  1977cited by this paper
• A Discipline of Programming

  1976cited by this paper
• First version of a data flow procedure language

  1974cited by this paper
• The Semantics of a Simple Language for Parallel Programming

  1974cited by this paper
• Fast on-line integer multiplication

  1973cited by this paper
• On Computable Numbers, with an Application to the Entscheidungsproblem.

  1937cited by this paper

• Chatbots as Turing Machines

  2025cites this paper
• Models of High-Level Computation

  2024cites this paper
• On the formalization of the notion of an algorithm

  2024cites this paper
• Formalizing the Notions of Non-Interactive and Interactive Algorithms

  2024cites this paper
• Automata theory based on complete residuated lattice-valued logic: Turing machines. (English)

  2022cites this paper
• Modelling interactive computing systems: Do we have a good theory of what computers are?

  2022cites this paper
• Vers la complétude interactive: exigences pour une machine abstraite orientée interaction: Toward Interactive Completeness: Requirements for an Interactive Abstract Machine

  2021cites this paper
• A thesis for interaction

  2021cites this paper
• A configurable and executable model of Spark Streaming on Apache YARN

  2020cites this paper
• Observation and Interaction - Invited Paper

  2019cites this paper
• Preliminary study for developing instantaneous quantum computing algorithms (IQCA)

  2019cites this paper
• Coverage and Time-optimal Motion Planning for Autonomous Vehicles

  2019cites this paper
• Transition-Based Coding and Formal Language Theory for Ordered Digraphs

  2019cites this paper
• Topological Interpretation of Interactive Computation

  2019influential citation
• Question answering by humans and machines: A complexity-theoretic view

  2019cites this paper
• Principles of robot autonomy

  2018cites this paper
• Permanent Persistent Turing Machine: A new Model for Interactive Computation

  2018cites this paper
• Modeling and Simulation of Spark Streaming

  2018cites this paper
• $\varepsilon ^{\star }$: An Online Coverage Path Planning Algorithm

  2018cites this paper
• A theory of executability : with a focus on the expressivity of process calculi

  2018cites this paper
• From the Chinese room argument to the Church-Turing thesis

  2018cites this paper
• Anomalous Diffusion within the Transcriptome as a Bio-Inspired Computing Framework for Resilience

  2017cites this paper
• 'Viral' Turing Machines, Computation from Noise and Combinatorial Hierarchies

  2017cites this paper
• Question-answering and cognitive automata with background intelligence

  2016cites this paper
• Traffic Models for Self-driving Connected Cars

  2016cites this paper
• Closed Loops in Neuroscience and Computation: What It Means and Why It Matters

  2016cites this paper
• Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages

  2016cites this paper
• An Empirical Analysis of Security and Privacy in Health and Medical Systems

  2016cites this paper
• Expressive power of first-order recurrent neural networks determined by their attractor dynamics

  2016cites this paper
• Fair Schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions

  2015cites this paper
• CCS: It’s not fair!

  2015cites this paper
• Recurrent Neural Networks and Super-Turing Interactive Computation

  2015influential citation
• Computability and realizability for interactive computations

  2015cites this paper
• Run-DMA

  2015cites this paper
• Strategy machines: representation and complexity of strategies in infinite games

  2014cites this paper
• Verifying of interface assertions for infinite state Mealy machines

  2014cites this paper
• Turing and the evaluation of intelligence

  2014cites this paper
• Strategy Composition in Compositional Games

  2013cites this paper
• Rigorous system design

  2013cites this paper
• Emergence in stigmergic and complex adaptive systems: A formal discrete event systems perspective

  2013cites this paper
• Multi-Agent based cooperative search in combinatorial optimisation

  2013cites this paper
• Abstract platforms of computation

  2013cites this paper
• Computational Complexity of Interactive Behaviors

  2012cites this paper
• Automata theory based on complete residuated lattice-valued logic: Turing machines

  2012cites this paper
• The Computational Power of Interactive Recurrent Neural Networks

  2012cites this paper
• A Review of Fuzzy Computations

  2012cites this paper
• A Computability Argument Against Superintelligence

  2012cites this paper
• From computability to executability : a process-theoretic view on automata theory

  2011cites this paper
• Towards Developmental Turing Machines

  2011cites this paper
• Some Bridging Results and Challenges in Classical, Quantum and Computational Randomness

  2011cites this paper
• Reactive Turing machines

  2011cites this paper
• An Introduction to Perception Based Computing

  2010cites this paper
• Introduction to Perception Based Computing

  2010cites this paper
• On the Expressiveness of Reactive Turing Machines and ACP τ Last update : 1 July 2010

  2010cites this paper
• Information systems in modeling interactive computations on granules

  2010cites this paper
• RANDOMNESS : FOUR QUESTIONS AND SOME CHALLENGES

  2010cites this paper
• Fexprs as the basis of Lisp function application; or, $vau: the ultimate abstraction

  2010cites this paper
• Reactive Turing Machines and ACP τ

  2010cites this paper
• How We Think of Computing Today

  2008cites this paper
• Streaming Dyadic Boolean Operations

  2008cites this paper
• Intelligence Integration in Distributed Knowledge Management

  2008cites this paper
• On the computing power of fuzzy Turing machines

  2008cites this paper
• Cyber-Physical Systems and Events

  2008cites this paper
• A Hardware Relaxation Paradigm for Solving NP-Hard Problems

  2008cites this paper
• Models of Interaction as a Grounding for Peer to Peer Knowledge Sharing

  2008cites this paper
• The Interactive Nature of Computing: Refuting the Strong Church–Turing Thesis

  2008cites this paper
• Classification of Runoff in Headwater Catchments: A Physical Problem?

  2008cites this paper
• A Formal Framework for Interactive Agents

  2008cites this paper
• On the evolution of conceptual modeling

  2008cites this paper
• Self-stabilizing Automata

  2008cites this paper
• A NOVEL TENDENCY IN PHILOSOPHICAL LOGIC

  2008cites this paper
• Approaching simple and powerful service-computing1

  2008cites this paper
• Die Waldbilder der Forstwissenschaften aus der Sicht der Ökologischen Modellbildung

  2008cites this paper
• Modelling the Interaction of Distributed Systems as Protocols

  2008cites this paper
• Computational composites

  2007cites this paper
• The $-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems

  2007cites this paper
• A Novel Cooperative Computing Model for Grid

  2007cites this paper
• Interaction and Realizability

  2007cites this paper
• Interactive Small-Step Algorithms I: Axiomatization

  2007cites this paper
• Are There New Models of Computation? Reply to Wegner and Eberbach

  2007cites this paper
• A Theory of Interactive Computation

  2006cites this paper
• Interactive Algorithms 2005 with Added Appendix

  2006influential citation
• Modeling and simulation of large biological, information and socio-technical systems: an interaction based approach

  2006cites this paper
• From Stream Transformers to Moore State Transition Machines with Input and Output

  2006cites this paper
• Classical Computability and Fuzzy Turing Machines

  2006cites this paper
• Modeling Viral Agents and Their Dynamics with Persistent Turing Machines and Cellular Automata

  2006cites this paper
• Concurrent Semantics Without the Notions of State or State Transitions

  2006cites this paper
• Evolvable Viral Agent Modeling and Exploration

  2006cites this paper
• Features of Emotional Planning in Software Agents

  2006cites this paper
• The Multidisciplinary Patterns of Interaction from Sciences to Computer Science

  2006cites this paper
• Foundations for the simulation of ecosystems

  2006cites this paper
• Computing and Interaction

  2006cites this paper
• Principles of Interactive Computation

  2006cites this paper
• Approaching Simple and Powerful Service-Computing

  2006cites this paper
• Modeling indirect interaction for evolving adaptive multi-agent systems in dynamic persistent environments yp

  2006cites this paper
• Composition of Interacting Computations

  2006cites this paper
• A Computational Model of Computer Worms Based on Persistent Turing Machines

  2006cites this paper
• Constraints on Hypercomputation

  2006cites this paper
• Characterization of the Dynamic Service Generation Concept

  2006cites this paper
• Interactive Models for Design of Software-Intensive Systems

  2005influential citation