Results 1  10
of
393
Theory of one tape linear time Turing machines
 Proc. 30th SOFSEM Conference on Current Trends in Theory and Practice of Computer Science, Lecture Notes in Computer Science, Vol.2932, pp.335–348
, 2004
"... Abstract. A theory of onetape lineartime Turing machines is quite different from its polynomialtime counterpart. This paper discusses the computational complexity of onetape Turing machines of various machine types (deterministic, nondeterministic, reversible, alternating, probabilistic, countin ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
Abstract. A theory of onetape lineartime Turing machines is quite different from its polynomialtime counterpart. This paper discusses the computational complexity of onetape Turing machines of various machine types (deterministic, nondeterministic, reversible, alternating, probabilistic
Quantum complexity theory
 in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract

Cited by 574 (5 self)
 Add to MetaCart
to be specified. We prove that O(log T) bits of precision suffice to support a T step computation. This justifies the claim that the quantum Turing machine model should be regarded as a discrete model of computation and not an analog one. We give the first formal evidence that quantum Turing machines violate
Large Margin Classification Using the Perceptron Algorithm
 Machine Learning
, 1998
"... We introduce and analyze a new algorithm for linear classification which combines Rosenblatt 's perceptron algorithm with Helmbold and Warmuth's leaveoneout method. Like Vapnik 's maximalmargin classifier, our algorithm takes advantage of data that are linearly separable with large ..."
Abstract

Cited by 521 (2 self)
 Add to MetaCart
We introduce and analyze a new algorithm for linear classification which combines Rosenblatt 's perceptron algorithm with Helmbold and Warmuth's leaveoneout method. Like Vapnik 's maximalmargin classifier, our algorithm takes advantage of data that are linearly separable
Software Protection and Simulation on Oblivious RAMs
, 1993
"... Software protection is one of the most important issues concerning computer practice. There exist many heuristics and adhoc methods for protection, but the problem as a whole has not received the theoretical treatment it deserves. In this paper we provide theoretical treatment of software protectio ..."
Abstract

Cited by 312 (15 self)
 Add to MetaCart
simulate, online, a onetape Turing Machine, with a logarithmic slowdown in the running time. We s...
Quantum Circuit Complexity
, 1993
"... We study a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any function computable in polynomial time by a quantum Turing machine has a polynomialsize quantum circuit. This result also enables us to construct a universal quantum compu ..."
Abstract

Cited by 320 (1 self)
 Add to MetaCart
We study a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any function computable in polynomial time by a quantum Turing machine has a polynomialsize quantum circuit. This result also enables us to construct a universal quantum
Infinite time Turing machines with only one tape
 MLQ. Mathematical Logic Quarterly
, 2001
"... Abstract. Infinite time Turing machines with only one tape are in many respects fully as powerful as their multitape 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 com ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
Abstract. Infinite time Turing machines with only one tape are in many respects fully as powerful as their multitape 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
Nondeterministic OneTape OffLine Turing Machines and Their Time Complexity
, 2009
"... In this paper we consider the time and the crossing sequence complexities of onetape offline Turing machines. We show that the running time of each nondeterministic machine accepting a nonregular language must grow at least as n log n, in the case all accepting computations are considered (accept m ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper we consider the time and the crossing sequence complexities of onetape offline Turing machines. We show that the running time of each nondeterministic machine accepting a nonregular language must grow at least as n log n, in the case all accepting computations are considered (accept
Flow Diagrams, Turing Machines and Languages with only Two Formation Rules
 Communications of the ACM
, 1966
"... In the first part of the paper, flow diagrams are introduced to represent inter ah mappings of a set into itself. Although not every diagram is decomposable into a finite numbm of given base diagrams, this becomes hue at a semantical level due to a suitable extension of the given set and of the basi ..."
Abstract

Cited by 174 (0 self)
 Add to MetaCart
and of the basic mappings defined in it. Two normalization methods of flow diagrams are given. The first has hree base diagrams; the second, only two. In the second part of the paper, the second method is applied to 'lhe theory of Turing machines. With every Turing maching provided with a twoway halftape
New Lower Bounds for Element Distinctness on a Onetape Turing Machine
"... It is shown that the Element Distinctness Problem (n numbers of k log n bits each, k 2) on a onetape Turing machine takes time proportional to almost the square of the size of the input. The proof holds for both deterministic and nondeterministic Turing machines. This proof improves the best know ..."
Abstract
 Add to MetaCart
It is shown that the Element Distinctness Problem (n numbers of k log n bits each, k 2) on a onetape Turing machine takes time proportional to almost the square of the size of the input. The proof holds for both deterministic and nondeterministic Turing machines. This proof improves the best
Element distinctness problem on onetape Turing machine
"... Recently L'opezOrtiz [IPL 51 (1994) 311314] showed that the Element Distinctness Problem (n numbers of k log n bits each, k 2) on a onetape Turing machine (deterministic or nondeterministic) requires at least\Omega\Gamma n 2 log n) time. His proof uses Kolmogorov complexity. This paper ..."
Abstract
 Add to MetaCart
Recently L'opezOrtiz [IPL 51 (1994) 311314] showed that the Element Distinctness Problem (n numbers of k log n bits each, k 2) on a onetape Turing machine (deterministic or nondeterministic) requires at least\Omega\Gamma n 2 log n) time. His proof uses Kolmogorov complexity. This paper
Results 1  10
of
393