Can any RAM BSS model based machine, or machines which are variants, recognize boolean languages(languages such as P, NP, or the like)? If so which languages are recognizable by RAM/BSS nachines, or its variants?(A variant could be to allow comparison. Or a RAM/BSS with weaker assumptions).
- The Separation of Relativized Versions of P and DNP for the Ring of the Reals. J. UCS 16(18): 2563-2568 (2010)
- Oracles and Relativizations of the P =? NP Question for Several Structures. J. UCS 15(6): 1186-1205 (2009)
- Relativizations of the P =? DNP Question for the BSS Model
You seem to be asking a basic question, namely: can BSS RAM machines recognize any boolean languages? Well, a BSS machine always has some kind of comparison operator, at the very least $<$ on real numbers. We can use it to decide equality of $0$ and $1$, from which it follows that a BSS machine can recognize at least all the languages that an ordinary RAM machine can. The more interesting question is whether it can do more than that, or perhaps more efficiently.