Results 1  10
of
3,204
Turing Machines
"... following changes occur: 1. The machine is put into a (possibly different) state. 2. The symbol under the read/write head is overwritten. 3. The read/write head moves exactly one cell, either to the right or to the left. This process continues until one of two events occurs: 1) the machine ente ..."
Abstract
 Add to MetaCart
enters an accept state, or 2) an undefined transition is encountered. In the latter case, the string is rejected, by definition. Definition 1 A Turing machine (TM) is formally specified by the 7tuple (\Sigma; \Gamma; Q; q 0 ; b; A; \Delta), where 1. \Sigma is a finite nonempty set called the input
Turing Machine
"... New research results from computer science, physics, logics, cognitive science, bioinformatics and related research fields provide strong reasons for us to try to generalize the idea of computing. Generalization of Turing concept of computation in essentially two ways: 1. Generalization of the model ..."
Abstract
 Add to MetaCart
New research results from computer science, physics, logics, cognitive science, bioinformatics and related research fields provide strong reasons for us to try to generalize the idea of computing. Generalization of Turing concept of computation in essentially two ways: 1. Generalization
Turing Machines
, 2012
"... Notice: This PDF version was distributed by request to members of the Friends of the SEP Society and by courtesy to SEP content contributors. It is solely for their fair use. Unauthorized distribution is prohibited. To learn how to join the Friends of the SEP Society and obtain authorized PDF versio ..."
Abstract
 Add to MetaCart
Notice: This PDF version was distributed by request to members of the Friends of the SEP Society and by courtesy to SEP content contributors. It is solely for their fair use. Unauthorized distribution is prohibited. To learn how to join the Friends of the SEP Society and obtain authorized PDF versions of SEP entries, please visit
Accelerated Turing Machines
 Minds and Machines
, 2002
"... Abstract. Accelerating Turing machines are Turing machines of a sort able to perform tasks that are commonly regarded as impossible for Turing machines. For example, they can determine whether or not the decimal representation of π contains n consecutive 7s, for any n; solve the Turingmachine halti ..."
Abstract

Cited by 33 (3 self)
 Add to MetaCart
Abstract. Accelerating Turing machines are Turing machines of a sort able to perform tasks that are commonly regarded as impossible for Turing machines. For example, they can determine whether or not the decimal representation of π contains n consecutive 7s, for any n; solve the Turingmachine
Turing Tests with Turing Machines
"... Comparative tests work by finding the difference (or the absence of difference) between a reference subject and an evaluee. The Turing Test, in its standard interpretation, takes (a subset of) the human species as a reference. Motivated by recent findings and developments in the area of machine inte ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
Comparative tests work by finding the difference (or the absence of difference) between a reference subject and an evaluee. The Turing Test, in its standard interpretation, takes (a subset of) the human species as a reference. Motivated by recent findings and developments in the area of machine
INTERNAL TURING MACHINES
, 2004
"... Abstract. Using nonstandard analysis, we will extend the classical Turing machines into the internal Turing machines. The internal Turing machines have the capability to work with infinite (∗finite) number of bits while keeping the finite combinatoric structures of the classical Turing machines. We ..."
Abstract
 Add to MetaCart
Abstract. Using nonstandard analysis, we will extend the classical Turing machines into the internal Turing machines. The internal Turing machines have the capability to work with infinite (∗finite) number of bits while keeping the finite combinatoric structures of the classical Turing machines
Beyond Turing Machines
"... In this paper we describe and analyze models of problem solving and computation going beyond Turing Machines. Three principles of extending the Turing Machine's expressiveness are identified, namely, by interaction, evolution and infinity. Several models utilizing the above principles are pr ..."
Abstract

Cited by 39 (6 self)
 Add to MetaCart
In this paper we describe and analyze models of problem solving and computation going beyond Turing Machines. Three principles of extending the Turing Machine's expressiveness are identified, namely, by interaction, evolution and infinity. Several models utilizing the above principles
COMPARATIVE ANALYSIS ON TURING MACHINE AND QUANTUM TURING MACHINE
"... AbstractNowadays every computing device is based on the Turing Machine. It is known that classical physics is sufficient to explain macroscopic phenomena, but is not to explain microscopic phenomena like the interference of electrons. In these days, speedup and downsizing of computing devices ..."
Abstract
 Add to MetaCart
AbstractNowadays every computing device is based on the Turing Machine. It is known that classical physics is sufficient to explain macroscopic phenomena, but is not to explain microscopic phenomena like the interference of electrons. In these days, speedup and downsizing of computing devices
The Turing Machine and Computability
"... In this project we look at Turing Machines and how they are used to prove properties about various problems. We examine the concept of multiple tape Turing Machines and how they relate to nondeterministic Turing Machines. We pay special attention to Minsky's Theorem which states that a Turing M ..."
Abstract
 Add to MetaCart
In this project we look at Turing Machines and how they are used to prove properties about various problems. We examine the concept of multiple tape Turing Machines and how they relate to nondeterministic Turing Machines. We pay special attention to Minsky's Theorem which states that a Turing
Noisy Turing machines
 In Proc. ICALP ’05, 32. International Colloquium on Automata, Languages, and Programming
, 2005
"... Abstract. Turing machines exposed to a small stochastic noise are considered. An exact characterisation of their ( ≈ Π 0 2) computational power (as noise level tends to 0) is obtained. From a probabilistic standpoint this is a theory of large deviations for Turing machines. 1 ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
Abstract. Turing machines exposed to a small stochastic noise are considered. An exact characterisation of their ( ≈ Π 0 2) computational power (as noise level tends to 0) is obtained. From a probabilistic standpoint this is a theory of large deviations for Turing machines. 1
Results 1  10
of
3,204