Higher-order complexity in analysis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Higher-order complexity in analysis

Abstract

We present ongoing work on the development of complexity theory in analysis. Kawamura and Cook recently showed how to carry out complexity theory on the space C[0,1] of continuous real functions on the unit interval. It is done, as in computable analysis, by representing objects by first-order functions (from finite words to finite words, say) and by measuring the complexity of a second-order functional in terms of second-order polynomials. We prove that this framework cannot be directly applied to spaces that are not $\sigma$-compact. However, representing objects by higher-order functions (over finite words, say) makes it possible to carry out complexity theory on such spaces: for this purpose we develop the complexity of higher-order functionals. At orders above 3, our class of polynomial-time computable functionals strictly contains the class BFF of Buss, Cook and Urquhart.
Fichier principal
Vignette du fichier
final.pdf (153.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00915973 , version 1 (09-12-2013)

Identifiers

  • HAL Id : hal-00915973 , version 1

Cite

Hugo Férée, Mathieu Hoyrup. Higher-order complexity in analysis. CCA - 10th International Conference on Computability and Complexity in Analysis - 2013, Jul 2013, Nancy, France. ⟨hal-00915973⟩
260 View
358 Download

Share

Gmail Facebook X LinkedIn More