Abstract
We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such programs relying on second order interpretation that characterize two variants of type 2 polynomial complexity including the Basic Feasible Functions (BFF). These characterizations provide a new insight on the complexity of stream programs. Finally, we adapt these results to functions over the reals, a particular case of type 2 functions, and we provide a characterization of polynomial time complexity in Recursive Analysis.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amadio, R.M.: Synthesis of max-plus quasi-interpretations. Fundamenta Informaticae 65(1), 29–60 (2005)
Bellantoni, S., Cook, S.A.: A new recursion-theoretic characterization of the polytime functions. Computational complexity 2(2), 97–110 (1992)
Bonfante, G., Marion, J.Y., Moyen, J.Y.: Quasi-interpretations. Theor. Comput. Sci. (to appear)
Cobham, A.: The Intrinsic Computational Difficulty of Functions. In: Logic, methodology and philosophy of science III, p. 24. North-Holland Pub. Co., Amsterdam (1965)
Constable, R.L.: Type two computational complexity. In: Proc. 5th annual ACM STOC, pp. 108–121 (1973)
Endrullis, J., Grabmayer, C., Hendriks, D., Isihara, A., Klop, J.W.: Productivity of stream definitions. Theor. Comput. Sci. 411(4-5), 765–782 (2010)
Gaboardi, M., Péchoux, R.: Upper Bounds on Stream I/O Using Semantic Interpretations. In: Grädel, E., Kahle, R. (eds.) CSL 2009. LNCS, vol. 5771, pp. 271–286. Springer, Heidelberg (2009)
Irwin, R.J., Royer, J.S., Kapron, B.M.: On characterizations of the basic feasible functionals (Part I). J. Funct. Program. 11(1), 117–153 (2001)
Kapron, B.M., Cook, S.A.: A new characterization of type-2 feasibility. SIAM Journal on Computing 25(1), 117–132 (1996)
Ko, K.I.: Complexity theory of real functions. Birkhauser Boston Inc., Cambridge (1991)
Lankford, D.: On proving term rewriting systems are noetherien. Tech. Rep. (1979)
Leivant, D., Marion, J.Y.: Lambda calculus characterizations of poly-time. In: Typed Lambda Calculi and Applications, pp. 274–288 (1993)
Manna, Z., Ness, S.: On the termination of Markov algorithms. In: Third Hawaii International Conference on System Science, pp. 789–792 (1970)
Mehlhorn, K.: Polynomial and abstract subrecursive classes. In: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 96–109. ACM, New York (1974)
Ramyaa, R., Leivant, D.: Feasible functions over co-inductive data. In: WoLLIC, pp. 191–203 (2010)
Seth, A.: Turing machine characterizations of feasible functionals of all finite types. In: Feasible Mathematics II, pp. 407–428 (1995)
Weihrauch, K.: Computable analysis: an introduction. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Férée, H., Hainry, E., Hoyrup, M., Péchoux, R. (2010). Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity. In: Cheong, O., Chwa, KY., Park, K. (eds) Algorithms and Computation. ISAAC 2010. Lecture Notes in Computer Science, vol 6506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17517-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-17517-6_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17516-9
Online ISBN: 978-3-642-17517-6
eBook Packages: Computer ScienceComputer Science (R0)