On the power of real Turing machines over binary inputs (1997)
by
Felipe Cucker
,
Dima Grigoriev
| Venue: | SIAM Journal on Computing |
| Citations: | 19 - 2 self |
BibTeX
@ARTICLE{Cucker97onthe,
author = {Felipe Cucker and Dima Grigoriev},
title = {On the power of real Turing machines over binary inputs},
journal = {SIAM Journal on Computing},
year = {1997},
volume = {26},
pages = {243--254}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper is to prove that BP(PAR IR ) = PSPACE/poly where PAR IR is the class of sets computed in parallel polynomial time by (ordinary) real Turing machines. As a consequence we obtain the existence of binary sets that do not belong to the Boolean part of PAR IR (an extension of the result in [20] since PH IR ` PAR IR ) and a separation of complexity classes in the real setting.
