I do have a Problem reasoning about binarry addition in terms of shift operations, but in the simplest case, a modulo 2 ring with reminder is just that. Easier? I don't know. Useful? Sure.
Of course by Cayley's theorem you can think of this group as made by transformations. The element n is the transformation that "shifts" the numberline n steps in the positive direction. Then 2+2=4 means that shifting by two and then two again results in a shift of four. But this is a very forced way of thinking about addition.
Kind of like how if you talk about points as elements of a vector space, it's useful to think of them as translations from the origin...
When you wonder "why does subtraction work" (guaranteed by the group structure), then thinking about shifts is a nice visual illustration, especially when you have modular arithmetic.
Also, some groups aren't naturally transformation groups. Is it really easier to think of addition of integers as being composition of shifts?