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.
Evidence: It is a model of computation equivalent to a Turing machine, and therefore it can process the same class of formal languages.