Moore, Dan; Case, John The complexity of total order structures. (English) Zbl 0396.03034 J. Comput. Syst. Sci. 17, 253-269 (1978). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page MSC: 03D15 Complexity of computation (including implicit computational complexity) 03D20 Recursive functions and relations, subrecursive hierarchies 06A05 Total orders Keywords:Computational Complexity; Total Order; Recursive Function; Recursively Enumerable Sets; Speedup PDFBibTeX XMLCite \textit{D. Moore} and \textit{J. Case}, J. Comput. Syst. Sci. 17, 253--269 (1978; Zbl 0396.03034) Full Text: DOI References: [1] Blum, M., A machine independent theory of complexity of recursive functions, J. Assoc. Comput. Mach., 14, 322-336 (1967) · Zbl 0155.01503 [2] Blum, M.; Marques, I., On complexity properties of recursively enumerable sets, J. Symbolic Logic, 38, 579-593 (1973) · Zbl 0335.02024 [3] Case, J., Strong Operator Recursion Theorem and an Application to Automata, (Recursive Function Theory: Newsletter, No 2 (1972)), 15-17 [4] Case, J., Effectively Entending the Set of Acceptable Inputs of Programs, (TR 68 (December 1973), Computer Science Department: Computer Science Department SUNY at Buffalo) · Zbl 0319.68026 [5] Case, J., Sortability and Extensibility of the Graphs of R.E. Partial and Total Orders, (TR 69 (December 1973), Computer Science Department: Computer Science Department SUNY at Buffalo) · Zbl 0338.02021 [6] Crossley, J., Constructive Order Types (1969), North-Holland: North-Holland Amsterdam · Zbl 0184.02201 [7] Gill, J.; Blum, M., On almost everywhere complex recursive functions, J. Assoc. Comput. Mach., 21, 425-435 (1974) · Zbl 0315.68038 [8] Hartmanis, J.; Stearns, R. E., On the computational complexity of algorithms, Trans. Amer. Math. Soc., 117, 285-306 (1965) · Zbl 0131.15404 [9] Meyer, A. R.; Fischer, P. C., Computational speed-up by effective operators, J. Symbolic Logic, 37, 55-68 (1972) · Zbl 0249.68018 [10] Morris, P., Recursive Function Theory: Newsletter, No. 2, 10-11 (1972), Item No. 25 [11] P. Morris; P. Morris [12] Rabin, M. O., Degree of Difficulty of Computing a Function and a Partial Ordering of Recursive Sets, (TR 2 (1960), Hebrew University: Hebrew University Jerusalem) [13] Rogers, H., Theory of Recursive Functions and Effective Computability (1967), McGraw-Hill: McGraw-Hill New York · Zbl 0183.01401 [14] Young, P., Toward a theory of enumerations, J. Assoc. Comput. Mach., 16, 328-348 (1969) · Zbl 0191.30801 [15] Young, P., Speed-ups by changing the order in which sets are enumerated, Corrigendum, 7, 352 (1973) · Zbl 0218.68004 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.