Verifying whether one-tape Turing machines run in linear time
نویسندگان
چکیده
منابع مشابه
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) ...
متن کامل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) ...
متن کاملInfinite Time Turing Machines With Only One Tape
Infinite time Turing machines with only one tape are in many respects fully as powerful as their multi-tape cousins. In particular, the two models of machine give rise to the same class of decidable sets, the same degree structure and, at least for functions f .. R → N, the same class of computable functions. Nevertheless, there are infinite time computable functions f : R → R that are not one-...
متن کاملNondeterministic One-Tape Off-Line Turing Machines
Finite state control Semi-infinite tape which contains, at the beginning of the computation: the input string, on its part of the tape the blank symbol, in the remaining squares According to the transition function at each step the machine: changes its internal state writes a nonblank symbol on the scanned tape square moves the head either to the left, or to the right, or keeps it on the same s...
متن کاملThe Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract)
We discuss the power and limitation of various “advice,” when it is given particularly to weak computational models of one-tape linear-time Turing machines and one-way finite (state) automata. Of various advice types, we consider deterministically-chosen advice (not necessarily algorithmically determined) and randomly-chosen advice (according to certain probability distributions). In particular...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2020
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2019.08.004