Register machines with counters (RC machines) are studied. It is shown that any computable function can be strictly computed on RC machines with a bounded number of counters and programs. The place in the Kleene-Mostowski hierarchy of certain algorithmic problems related to RC machines is determined.