论文信息 - Type 2 Computational Complexity of Functions on Cantor's Space

Type 2 Computational Complexity of Functions on Cantor's Space

Abstract Continuity and computability on Cantor's space C has turned out to be a very natural basis for a Type 2 theory of effectivity (TTE). In particular, the investigation of Type 2 computational complexity (e.g. complexity in analysis) requires the study of oracle machines which (w.l.g) operate on Cantor's space. However, no general Type 2 complexity theory has been developed so far. In this paper we lay a foundation for this theory by investigating computational complexity of functions Γ: C →{0, 1} ∗ and ∑: C → C and the related concepts of dependence and input-lookahead. In the former case results of Gordon and Shamir are extended and generalized. For continuous functions ∑: C → C the relation between the three concepts is studied in detail. Compact sets are proved to be natural domains of resource bounded functions on C . Finally, we demonstrate that an optimization of the input-lookahead used by a machine may result in a rapid increase of computation time.

Christoph Kreitz | Klaus Weihrauch | C. Kreitz | K. Weihrauch

[1] Christoph Kreitz,et al. Representations of the real numbers and of the open subsets of the set of real numbers , 1987, Ann. Pure Appl. Log..

[2] Norbert Th. Müller. Subpolynomial Complexity Classes of Real Functions and Real Numbers , 1986, ICALP.

[3] Dan Gordon,et al. Computation of Recursive Functionals Using Minimal Initial Segments , 1983, Theor. Comput. Sci..

[4] Klaus Weihrauch,et al. Dependence, convergence, and computational complexity of continuous functionals and operators on Cantor's space , 1987 .

[5] J. Shepherdson. Computational Complexity of Real Functions , 1985 .

[6] Richard P. Brent,et al. Fast Multiple-Precision Evaluation of Elementary Functions , 1976, JACM.

[7] Norbert Th. Müller,et al. Uniform Computational Complexity of Taylor Series , 1987, ICALP.

[8] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[9] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[10] Klaus Weihrauch,et al. Type 2 Recursion Theory , 1985, Theor. Comput. Sci..

[11] J. Ersov. Theorie der Numerierungen II , 1973 .

[12] Christoph Kreitz,et al. Compactness in constructive analysis revisited , 1987, Ann. Pure Appl. Log..

[13] Christoph Kreitz,et al. Theory of Representations , 1985, Theor. Comput. Sci..