Abstract
We provide a fairly complete picture of the complexity theory of additive real machines. This model of computation is a restriction of the real Turing machine of Blum et al. (1989), since addition and subtraction are the only legal arithmetic operations. Removing the order relation < on R yields an even weaker class of machines, which is also studied. Our main results are: • characterization of the classes of recognizable Boolean languages; • equivalence of real and digital nondeterminism; • a simpler proof of Meer's P lin ≠ NP lin result.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
