Abstract
The purpose of this paper is to show that there are sets for which really large improvements in enumeration times can only be achieved by programs which change the order in which the sets are enumerated and not by programs which merely speed up the enumeration times without changing the order in which the sets are enumerated. We do this by proving, in a suitably general context, the following analogue of the Blum speedup theorem: There are some infinite sets which are so difficult to enumerate that, given any order for enumerating the set, there is some other order and someone method of enumerating the set in this second order which is much faster thanany method of enumerating the set in the first ordering. The proof itself is one of the first nontrivial applications of priority methods to questions of computational complexity. (See also [8], [6], and [3] for more such applications.)
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Manuel Blum, A machine-independent theory of computational complexity,J. Assoc. Comput. Mach. 14 (1967), 322–336.
Manuel Blum, On the size of machines,Information and Control 11 (1967), 257–265.
R. L. Constable, The operator gap,Proc. 10th I.E.E.E. Symp. on Switching and Automata Theory, 1969.
J. P. Helm,Two topics in recursion theory: I. Effective operators and II. Order and difficulty of enumeration of sets, Ph.D. Thesis, Purdue Univ., 1970.
A. R. Meyer andP. C. Fisher, Computational speed-up by effective operators (to appear).
E. M. McCreight andA. R. Meyer, Classes of computable functions defined by bounds on computation, Preliminary report, 1st ACM Symp. on Theory of Computing (1969), pp. 79–88.
H. Rogers, Jr.,Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
R. W. Robinson, A dichotomy of the recursively enumerable sets,Z. Math. Logik Grundlagen Math. 14 (1968), 339–356.
Paul Young, Toward a theory of enumerations,J. Assoc. Comput. Mach. 16 (1969), 328–348.
Paul Young, Speed-ups by changing the order in which sets are enumerated, Purdue Computer Sciences Dept. Tech. Report TR-31, Dec., 1968.
Paul Young, Speed-ups by changing the order in which sets are enumerated, Preliminary abstract, 1st ACM Symp. on Theory of Computing (1969), pp. 89–92.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Young, P. Speed-Ups by changing the order in which sets are enumerated. Math. Systems Theory 5, 148–156 (1971). https://doi.org/10.1007/BF01702871
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01702871