Yes, both counter machines and random access machines are Turing complete. The inclusion of indirect addressing does not expand the range of functions that can be computed - it simply makes programming simpler and improves notional efficiency (although the efficiency of an abstract machine is a rather vague concept).

Only top voted, non community-wiki answers of a minimum length are eligible