We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
Queue automaton
A queue automaton is a kind of imaginary machine consisting of a finite-state automaton (FSA) hooked up to an unbounded queue. It is conceptually similar to a push-down automaton (PDA) but uses a queue instead of a stack.
Unlike PDAs, queue automata are equivalent to Turing machines (that is because a queue can be considered as a self-extending tape), so languages based on them would be capable of solving all computable problems by default instead of being in the interesting situation of being able to solve only some problems.