Characterizing the orders changed by program translators

Abstract

The ways in which translators from one programming system for the recursively enumerable sets to another such programming system can change the orders of the sets being translated are characterized using the computable functions which permute infinitely many initial segments. © 1978 by Pacific Journal of Mathematics.