input: Background: Many machine models different from the standard multi-tape Turing machines have been proposed in the literature, for example random access machines. Perhaps surprisingly, each of these models can be converted to another without providing any extra computational power. The time and memory consumption of these alternate models may vary. What all these models have in common is that the machines operate deterministically.
  Question: What is an example of a machine model that deviates from a generally accepted multi-tape Turing machine?
  Answer:<extra_id_0>.
output: <extra_id_0> random access machines<extra_id_1>