Results 11  20
of
3,204
On Immortal Configurations in Turing Machines
, 2012
"... Abstract We investigate the immortality problem for Turing machines and prove that there exists a Turing Machine that is immortal but halts on every recursive configuration. The result is obtained by combining a new proof of Hooper’s theorem [11] with recent results on effective symbolic dynamics. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract We investigate the immortality problem for Turing machines and prove that there exists a Turing Machine that is immortal but halts on every recursive configuration. The result is obtained by combining a new proof of Hooper’s theorem [11] with recent results on effective symbolic dynamics.
On the transition graphs of Turing machines
 3rd MCU, LNCS 2055, M
"... As for pushdown automata, we consider labelled Turing machines with rules. With any Turing machineM and with a rational set C of congurations, we associate the restriction to C of the "closure of the transition set of M. We get the same family of graphs by using the labelled word rewriting sy ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
As for pushdown automata, we consider labelled Turing machines with rules. With any Turing machineM and with a rational set C of congurations, we associate the restriction to C of the "closure of the transition set of M. We get the same family of graphs by using the labelled word rewriting
Beyond The Universal Turing Machine
, 1998
"... We describe an emerging field, that of nonclassical computability and nonclassical computing machinery. According to the nonclassicist, the set of welldefined computations is not exhausted by the computations that can be carried out by a Turing machine. We provide an overview of the field and a phi ..."
Abstract

Cited by 31 (2 self)
 Add to MetaCart
We describe an emerging field, that of nonclassical computability and nonclassical computing machinery. According to the nonclassicist, the set of welldefined computations is not exhausted by the computations that can be carried out by a Turing machine. We provide an overview of the field and a
Functional Encryption for Turing Machines
"... In this work, we construct an adaptively secure functional encryption for Turing machines scheme, based on indistinguishability obfuscation for circuits. Our work places no restrictions on the types of Turing machines that can be associated with each secret key, in the sense that the Turing machines ..."
Abstract
 Add to MetaCart
In this work, we construct an adaptively secure functional encryption for Turing machines scheme, based on indistinguishability obfuscation for circuits. Our work places no restrictions on the types of Turing machines that can be associated with each secret key, in the sense that the Turing
Deadline Turing Machine
"... Abstract — We report on a new computational model namely the Deadline Turing Machine DTM. The DTM is an extension, although less powerful, of the well known Turing Machine(TM) [2]. It uses a deadline within words of a given language can be recognized and decided. If a word cannot be decided within t ..."
Abstract
 Add to MetaCart
Abstract — We report on a new computational model namely the Deadline Turing Machine DTM. The DTM is an extension, although less powerful, of the well known Turing Machine(TM) [2]. It uses a deadline within words of a given language can be recognized and decided. If a word cannot be decided within
Turing machines and bimachines
, 2008
"... We associate the iterated block product of a bimachine with a deterministic Turing machine. This allows us to introduce new algebraic notions to study the behavior of the Turing machine. Namely, we introduce double semidirect products through matrix multiplication of upper triangular matrices with c ..."
Abstract
 Add to MetaCart
We associate the iterated block product of a bimachine with a deterministic Turing machine. This allows us to introduce new algebraic notions to study the behavior of the Turing machine. Namely, we introduce double semidirect products through matrix multiplication of upper triangular matrices
Dynamics of Abstract Turing Machines
, 2014
"... Turing machines have been well studided in the context of Computability theory, looking at computations starting from a very specific state and a given input. We intend to study here Turing machines from the point of view of dynamical systems, that is consider Turing machines starting from any input ..."
Abstract
 Add to MetaCart
Turing machines have been well studided in the context of Computability theory, looking at computations starting from a very specific state and a given input. We intend to study here Turing machines from the point of view of dynamical systems, that is consider Turing machines starting from any
Beyond Turing Machines ∗
, 907
"... www.cstruct.org This paper discusses ”computational ” systems capable of ”computing” functions not computable by predefined Turing machines if the systems are not isolated from their environment. Roughly speaking, these systems can change their finite descriptions by interacting with their environme ..."
Abstract
 Add to MetaCart
www.cstruct.org This paper discusses ”computational ” systems capable of ”computing” functions not computable by predefined Turing machines if the systems are not isolated from their environment. Roughly speaking, these systems can change their finite descriptions by interacting
Neural Turing Machines
"... We extend the capabilities of neural networks by coupling them to external memory resources, which they can interact with by attentional processes. The combined system is analogous to a Turing Machine or Von Neumann architecture but is differentiable endtoend, allowing it to be efficiently traine ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We extend the capabilities of neural networks by coupling them to external memory resources, which they can interact with by attentional processes. The combined system is analogous to a Turing Machine or Von Neumann architecture but is differentiable endtoend, allowing it to be efficiently
Super TuringMachines
"... to a practical application. A dozen years later the first storedprogram electronic digital computers began to spring into existence. All were modelled on the universal Turing machine. Today's digital computers also are in essence universal Turing machines. 2. Is There a Known Upper Bound to ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
to a practical application. A dozen years later the first storedprogram electronic digital computers began to spring into existence. All were modelled on the universal Turing machine. Today's digital computers also are in essence universal Turing machines. 2. Is There a Known Upper Bound
Results 11  20
of
3,204