Results 201 to 210 of about 2,960,567 (255)
Some of the next articles are maybe not open access.
Mathematical Systems Theory, 1971
Suppose a Turing machine is equipped with an extra tape. At each step of a computation being performed, it prints symbol read move symbol symbol printed on a square of the extra tape. It then moves the extra tape one square to the left. This procedure yields arecord of the computation.
openaire +3 more sources
Suppose a Turing machine is equipped with an extra tape. At each step of a computation being performed, it prints symbol read move symbol symbol printed on a square of the extra tape. It then moves the extra tape one square to the left. This procedure yields arecord of the computation.
openaire +3 more sources
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013
We study Turing machines over sets with atoms, also known as nominal sets. Our main result is that deterministic machines are weaker than nondeterministic ones; in particular, P6=NP in sets with atoms. Our main construction is closely related to the Cai-Furer-Immerman graphs used in descriptive complexity theory.
Mikolaj Bojanczyk +3 more
openaire +1 more source
We study Turing machines over sets with atoms, also known as nominal sets. Our main result is that deterministic machines are weaker than nondeterministic ones; in particular, P6=NP in sets with atoms. Our main construction is closely related to the Cai-Furer-Immerman graphs used in descriptive complexity theory.
Mikolaj Bojanczyk +3 more
openaire +1 more source
Minds and Machines, 2002
Summary: 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 \(\pi\) contains \(n\) consecutive 7s, for any \(n\); solve the Turing-machine halting problem; and decide the predicate ...
openaire +2 more sources
Summary: 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 \(\pi\) contains \(n\) consecutive 7s, for any \(n\); solve the Turing-machine halting problem; and decide the predicate ...
openaire +2 more sources
Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms
Fundamenta Informaticae, 2009The aim of this paper is the development of foundations for evolutionary computations. To achieve this goal, a mathematical model of evolutionary automata is introduced and studied. The main classes of evolutionary automata considered in this paper are evolutionary Turing machines and evolutionary inductive Turing machines.
Mark Burgin, Eugene Eberbach
openaire +2 more sources
On formalisms for turing machines
1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design, 1964In this paper various formal definitions for the notion of a general-purpose abstract computer are compared and some new alternative definitions are introduced. Particular attention is paid to one of Turing's original formalisms and to one by Post. Most of the theorems assert that a certain kind of machine simulates another kind of machine. The concept
openaire +2 more sources
Natural Computing, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
People cannot distinguish GPT-4 from a human in a Turing test
Conference on Fairness, Accountability and TransparencyAI systems that can fool people into thinking that they are human could have widespread social and economic consequences. In order to measure this ability, we evaluated 3 systems (ELIZA, GPT-3.5 and GPT-4) in a randomized, controlled, and preregistered ...
Cameron R. Jones +3 more
semanticscholar +1 more source
2004
The goal of this paper is to investigate the power of Turing machines with homogeneous memory. The standard models of Turing machines often use tricks such as “special” symbols (delimiter) or several different tapes. These tricks are not natural: computers use only 0’s and 1’s and operating systems consider memory as a whole.
Bruno Durand 0001 +3 more
openaire +1 more source
The goal of this paper is to investigate the power of Turing machines with homogeneous memory. The standard models of Turing machines often use tricks such as “special” symbols (delimiter) or several different tapes. These tricks are not natural: computers use only 0’s and 1’s and operating systems consider memory as a whole.
Bruno Durand 0001 +3 more
openaire +1 more source
Fundam. Informaticae, 2007
Summary: We define Concurrent Turing Machines (CTMs) as Turing machines with Petri nets as finite control. This leads to machines with arbitrary many tape heads, thus subsuming any class of (constant) \(k\)-head Turing machines. Space, time, and head complexity classes are introduced and discussed showing the difference of various acceptance conditions
Berndt Farwer +2 more
openaire +2 more sources
Summary: We define Concurrent Turing Machines (CTMs) as Turing machines with Petri nets as finite control. This leads to machines with arbitrary many tape heads, thus subsuming any class of (constant) \(k\)-head Turing machines. Space, time, and head complexity classes are introduced and discussed showing the difference of various acceptance conditions
Berndt Farwer +2 more
openaire +2 more sources
2017
We consider graph Turing machines, a model of parallel computation on a graph, which provides a natural generalization of several standard computational models, including ordinary Turing machines and cellular automata. In this extended abstract, we give bounds on the computational strength of functions that graph Turing machines can compute.
Nathanael L. Ackerman, Cameron E. Freer
openaire +1 more source
We consider graph Turing machines, a model of parallel computation on a graph, which provides a natural generalization of several standard computational models, including ordinary Turing machines and cellular automata. In this extended abstract, we give bounds on the computational strength of functions that graph Turing machines can compute.
Nathanael L. Ackerman, Cameron E. Freer
openaire +1 more source