Results 1  10
of
3,229
RealTime Deques, Multihead Turing Machines, and Purely Functional Programming
 In Conference on Functional Programming Languages and Computer Architecture
, 1993
"... We answer the following question: Can a deque (double ended queue) be implemented in a purely functional language such that each push or pop operation on either end of a queue is accomplished in O(1) time in the worst case? The answer is yes, thus solving a problem posted by Gajewska and Tarjan [1 ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
, and can be used to give a realtime simulation of a multihead Turing machine in a purel...
New realtime simulations of multihead tape units.
 Proc. 9th Ann. ACM Symp. on Theory of Computing,
, 1977
"... ABSTRACT. Singlehead tapes are used to simulate multihead Turing machine tape units without loss. For onedimensional tapes, the new simulations are simpler and use far fewer tapes than prevj known simulations. For multidimensional tapes, the results are entirely new. ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
ABSTRACT. Singlehead tapes are used to simulate multihead Turing machine tape units without loss. For onedimensional tapes, the new simulations are simpler and use far fewer tapes than prevj known simulations. For multidimensional tapes, the results are entirely new.
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
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
On parallel Turing machines with multihead control units
 Parallel Computing
, 1996
"... This paper deals with parallel Turing machines with multihead control units on one or more tapes which can be considered as a generalization of cellular automata. We discuss the problem of finding an appropriate measure of space complexity. A definition is suggested which implies that the model is ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This paper deals with parallel Turing machines with multihead control units on one or more tapes which can be considered as a generalization of cellular automata. We discuss the problem of finding an appropriate measure of space complexity. A definition is suggested which implies that the model
The complexity of theoremproving procedures
 IN STOC
, 1971
"... It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract

Cited by 1050 (5 self)
 Add to MetaCart
It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved
Monotone Complexity
, 1990
"... We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple ..."
Abstract

Cited by 2825 (11 self)
 Add to MetaCart
We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a
Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I
, 1960
"... this paper in L a T E Xpartly supported by ARPA (ONR) grant N000149410775 to Stanford University where John McCarthy has been since 1962. Copied with minor notational changes from CACM, April 1960. If you want the exact typography, look there. Current address, John McCarthy, Computer Science Depa ..."
Abstract

Cited by 457 (3 self)
 Add to MetaCart
this formalism has advantages both as a programming language and as a vehicle for developing a theory of computation. Next, we describe Sexpressions and Sfunctions, give some examples, and then describe the universal Sfunction apply which plays the theoretical role of a universal Turing machine
RealTime Computing Without Stable States: A New Framework for Neural Computation Based on Perturbations
"... A key challenge for neural modeling is to explain how a continuous stream of multimodal input from a rapidly changing environment can be processed by stereotypical recurrent circuits of integrateandfire neurons in realtime. We propose a new computational model for realtime computing on timevar ..."
Abstract

Cited by 469 (38 self)
 Add to MetaCart
varying input that provides an alternative to paradigms based on Turing machines or attractor neural networks. It does not require a taskdependent construction of neural circuits. Instead it is based on principles of high dimensional dynamical systems in combination with statistical learning theory, and can
Strengths and weaknesses of quantum computing
, 1996
"... Recently a great deal of attention has focused on quantum computation following a sequence of results [4, 16, 15] suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor’s result that factoring and the extraction of discrete logarithms are both solv ..."
Abstract

Cited by 381 (10 self)
 Add to MetaCart
machine in time o(2 n/2). We also show that relative to a permutation oracle chosen uniformly at random, with probability 1, the class NP ∩ co–NP cannot be solved on a quantum Turing machine in time o(2 n/3). The former bound is tight since recent work of Grover [13] shows how to accept the class NP
On The Power Of OneWay Globally Deterministic Synchronized Alternating Turing Machines And Multihead Automata
"... The alternating model augmented by a special simple form of communication among parallel processes  the socalled synchronized alternating (SA) model, provides (besides others) nice characterizations of the space complexity classes defined by nondeterministic Turing machines. The model investigated ..."
Abstract
 Add to MetaCart
resume in the investigation of GDSA solving the open questions about the computational power of the oneway GDSA models. It is known that in the case of spacebounded Turing machine and multihead automata, the oneway SA models are equivalent to their twoway counterparts. We show that the same holds
Results 1  10
of
3,229