On the Power of Real Turing Machines over Binary Inputs

Authors:
Felipe Cucker;Dima Grigoriev
Affiliations:
-;-
Venue:
SIAM Journal on Computing
Year:
1997

Citing 0
Cited 13

Discontinuities in recurrent neural networks

Neural Computation
Transfer theorems via sign conditions

Information Processing Letters
Real computations with fake numbers

Journal of Complexity
Circuits versus Trees in Algebraic Complexity

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets

Journal of Complexity
Semidefinite programming and arithmetic circuit evaluation

Discrete Applied Mathematics
VPSPACE and a transfer theorem over the complex field

Theoretical Computer Science
Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets

Journal of Complexity
VPSPACE and a transfer theorem over the reals

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Uncomputability below the real halting problem

CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
VPSPACE and a transfer theorem over the complex field

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Exotic quantifiers, complexity classes, and complete problems

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the computational power of real Turing machines over binary inputs. Our main result is that the class of binary sets that can be decided by real Turing machines in parallel polynomial time is exactly the class PSPACE/poly.