scholarly journals Turing machines, transition systems, and interaction

2004 ◽  
Vol 194 (2) ◽  
pp. 101-128 ◽  
Author(s):  
Dina Q. Goldin ◽  
Scott A. Smolka ◽  
Paul C. Attie ◽  
Elaine L. Sonderegger
Keyword(s):  
Turing Machines ◽  
Transition Systems

scholarly journals Turing Machines, Transition Systems, and Interaction

2002 ◽  
Vol 52 (1) ◽  
pp. 120-136 ◽  
Author(s):  
Dina Q. Goldin ◽  
Scott A. Smolka ◽  
Peter Wegner
Keyword(s):  
Turing Machines ◽  
Transition Systems

scholarly journals Hereditary History Preserving Simulation is Undecidable

1999 ◽  
Vol 6 (1) ◽  
Author(s):  
Marcin Jurdzinski ◽  
Mogens Nielsen
Keyword(s):  
Simulation Game ◽  
Turing Machines ◽  
Transition Systems ◽  
Halting Problem ◽  
Intermediate Problem

We show undecidability of hereditary history preserving simulation<br />for finite asynchronous transition systems by a reduction from the halting<br />problem of deterministic Turing machines. To make the proof more<br />transparent we introduce an intermediate problem of deciding the winner<br />in domino snake games. First we reduce the halting problem of deterministic<br />Turing machines to domino snake games. Then we show how to<br />model a domino snake game by a hereditary history simulation game on<br />a pair of finite asynchronous transition systems.

Some Assumptions about Problem Solving Representation in Turing’s Model of Intelligence

1970 ◽  
Vol 4 (2) ◽  
pp. 136-142 ◽  
Author(s):  
Raymundo Morado ◽  
Francisco Hernández-Quiroz
Keyword(s):  
Problem Solving ◽  
Computational Models ◽  
Turing Machines

Turing machines as a model of intelligence can be motivated under some assumptions, both mathematical and philosophical. Some of these are about the possibility, the necessity, and the limits of representing problem solving by mechanical means. The assumptions about representation that we consider in this paper are related to information representability and availability, processing as solving, nonessentiality of complexity issues, and finiteness, discreteness and sequentiality of the representation. We discuss these assumptions and particularly something that might happen if they were to be rejected or weakened. Tinkering with these assumptions sheds light on the import of alternative computational models.

The Essence of Quantum Computing

2018 ◽  
Author(s):  
Rajendra K. Bera
Keyword(s):  
Hilbert Space ◽  
Quantum Computing ◽  
Quantum Physics ◽  
Quantum Algorithms ◽  
Quantum Computers ◽  
Turing Machines ◽  
Classical Physics ◽  
Core Set ◽  
The World ◽  
Subordinate Role

It now appears that quantum computers are poised to enter the world of computing and establish its dominance, especially, in the cloud. Turing machines (classical computers) tied to the laws of classical physics will not vanish from our lives but begin to play a subordinate role to quantum computers tied to the enigmatic laws of quantum physics that deal with such non-intuitive phenomena as superposition, entanglement, collapse of the wave function, and teleportation, all occurring in Hilbert space. The aim of this 3-part paper is to introduce the readers to a core set of quantum algorithms based on the postulates of quantum mechanics, and reveal the amazing power of quantum computing.

Neural Transition Systems for Modeling Hierarchical Semantic Representations

2019 ◽  
Author(s):  
Riyaz Bhat ◽  
John Chen ◽  
Rashmi Prasad ◽  
Srinivas Bangalore
Keyword(s):  
Semantic Representations ◽  
Transition Systems

Modeling Multitape Minsky and Turing Machines by Three-Tape Minsky Machines

2020 ◽  
Vol 46 (6) ◽  
pp. 428-432
Author(s):  
S. S. Marchenkov ◽  
S. D. Makeev
Keyword(s):  
Turing Machines

scholarly journals Turing machines with few accepting computations and low sets for PP

1992 ◽  
Vol 44 (2) ◽  
pp. 272-286 ◽  
Author(s):  
Johannes Kobler ◽  
Uwe Schïng ◽  
Seinosuke Toda ◽  
Jacobo Torán
Keyword(s):  
Turing Machines

scholarly journals Battery transition systems

2014 ◽  
Vol 49 (1) ◽  
pp. 595-606 ◽  
Author(s):  
Udi Boker ◽  
Thomas A. Henzinger ◽  
Arjun Radhakrishna
Keyword(s):  
Transition Systems

The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic

2021 ◽  
Vol 178 (1-2) ◽  
pp. 1-30
Author(s):  
Florian Bruse ◽  
Martin Lange ◽  
Etienne Lozes
Keyword(s):  
Model Checking ◽  
Lower Bounds ◽  
Expressive Power ◽  
Higher Order ◽  
Order Logic ◽  
High Complexity ◽  
Transition Systems ◽  
Recursive Formulas ◽  
Second Order Logic ◽  
Monadic Second Order Logic

Higher-Order Fixpoint Logic (HFL) is a modal specification language whose expressive power reaches far beyond that of Monadic Second-Order Logic, achieved through an incorporation of a typed λ-calculus into the modal μ-calculus. Its model checking problem on finite transition systems is decidable, albeit of high complexity, namely k-EXPTIME-complete for formulas that use functions of type order at most k < 0. In this paper we present a fragment with a presumably easier model checking problem. We show that so-called tail-recursive formulas of type order k can be model checked in (k − 1)-EXPSPACE, and also give matching lower bounds. This yields generic results for the complexity of bisimulation-invariant non-regular properties, as these can typically be defined in HFL.

Sign in / Sign up

Export Citation Format

Share Document