On the Executability of Interactive Computation

DOI10.1007/978-3-319-40189-8_32zbMath1475.68131arXiv1601.01546OpenAlexW2225941034MaRDI QIDQ3188271

Bas Luttik, Fei Yang

Publication date: 17 August 2016

Published in: Pursuit of the Universal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.01546

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Turing machines and related notions (03D10) Classical models of computation (Turing machines, etc.) (68Q04)

Related Items (3)

On the Executability of Interactive Computation ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reactive Turing machines
• On the Executability of Interactive Computation
• Branching Bisimilarity with Explicit Divergence
• A Process-Theoretic Look at Automata
• How We Think of Computing Today
• Branching time and abstraction in bisimulation semantics
• A Theory of Interactive Computation
• Reactive Systems
• Interactive Computation
• An Unsolvable Problem of Elementary Number Theory

This page was built for publication: On the Executability of Interactive Computation