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, Shub & Smale, 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: