Computing permutations with double-ended queues, parallel stacks and parallel queues

Abstract

Given a class of computers, it is natural to ask, what can they do? What functions of their inputs can they compute? For example, processors equipped with the constant zero, the successor function, and suitable recursive control mechanisms can compute precisely the partial recursive functions.