In the present study, we consider a computational model similar to the classical RAM machine, except that each instruction performed by the machine may fail with probability q < 1=6e: The failures are transient and independent of each other. The deenition of this model (which we call ERRAM) follows a previous work citelp, where we did not allow for addressing errors. We show how an arbitrary RA...