On the Power of Real Turing Machines over Binary Inputs
Felipe Cucker, Dima Grigoriev · SIAM Journal on Computing · 1997
In this paper, we study the computational power of real Turing machines over binary inputs. Our main result is that the class of binarysets that can be decided by real Turing machines in parallel polynomial time is exactly the class PSPACE/poly.