Linear-time simulation of multihead turing machines
نویسندگان
چکیده
منابع مشابه
Theory of One Tape Linear Time Turing Machines
A theory of one-tape (one-head) linear-time Turing machines is essentially different from its polynomial-time counterpart since these machines are closely related to finite state automata. This paper discusses structural-complexity issues of one-tape Turing machines of various types (deterministic, nondeterministic, reversible, alternating, probabilistic, counting, and quantum Turing machines) ...
متن کاملA Logical Characterisation of Linear Time on Nondeterministic Turing Machines
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of strings is in this class if and only if there is a formula of the form ∃f1· · ∃fk∃R1· · ∃Rm∀xφ that is true exactly for all strings in L. In this formula the fi are unary function symbols, the Ri are unary relation symbo...
متن کاملVerifying whether One-Tape Turing Machines Run in Linear Time
We discuss the following family of problems, parameterized by integersC ≥ 2 andD ≥ 1: Does a given one-tape q-state Turing machine make at mostCn+D steps on all computations on all inputs of length n, for all n? Assuming a fixed tape and input alphabet, we show that these problems are co-NP-complete and we provide good lower bounds. Specifically, these problems can not be solved in o(q(C−1)/4) ...
متن کاملImproved Simulation of Nondeterministic Turing Machines
The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large boundeddegree graph whose size is exponential in the running time of the NTM. The graph is the natural one defined by the configurations of the NTM. All methods in the literature have required time linear in the size S of this graph. This paper presents a new simulation method ...
متن کاملOn the simulation of quantum turing machines
In this article we shall review several basic de-nitions and results regarding quantum computation. In particular, after de-ning Quantum Turing Machines and networks the paper contains an exposition on continued fractions and on errors in quantum networks. The topic of simulation of Quantum Turing Machines by means of obvious computation is introduced. We give a full discussion of the simulatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1989
ISSN: 0890-5401
DOI: 10.1016/0890-5401(89)90037-0