Claim: The Queue automaton is very different from a Turing machine since a queue machine can be simulated more easily by a multi-tape Turing machine, a variant of the Turing machine that utilizes several tapes.
Evidence: It is a model of computation equivalent to a Turing machine, and therefore it can process the same class of formal languages. We can prove that a queue machine is equivalent to a Turing machine by showing that a queue machine can simulate a Turing machine and vice versa. A queue machine can be simulated by a Turing machine, but more easily by a multi-tape Turing machine, which is known to be equivalent to a normal single-tape machine.