Analytical properties of resource-bounded real functionals

Abstract : Computable analysis is an extension of classical discrete computability by enhancing the normal Turing machine model. It investigates mathematical analysis from the computability perspective. Though it is well developed on the computability level, it is still under developed on the complexity perspective, that is, when bounding the available computational resources. Recently Kawamura and Cook developed a framework to define the computational complexity of operators arising in analysis. Our goal is to understand the effects of complexity restrictions on the analytical properties of the operator. We focus on the case of norms over C[0,1] and introduce the notion of dependence of a norm on a point and relate it to the query complexity of the norm. We show that the dependence of almost every point is of the order of the query complexity of the norm. A norm with small complexity depends on a few points but, as compensation, highly depends on them. We briefly show how to obtain similar results for non-deterministic time complexity. We characterize the functionals that are computable using one oracle call only and discuss the uniformity of that characterization. This paper is a significant revision and expansion of an earlier conference version.
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-00848482
Contributor : Mathieu Hoyrup <>
Submitted on : Friday, July 26, 2013 - 11:19:53 AM
Last modification on : Tuesday, December 18, 2018 - 4:48:02 PM
Long-term archiving on : Sunday, October 27, 2013 - 3:17:29 AM

File

submitted_version.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Hugo Férée, Walid Gomaa, Mathieu Hoyrup. Analytical properties of resource-bounded real functionals. Journal of Complexity, Elsevier, 2014, 30 (5), pp.33. ⟨10.1016/j.jco.2014.02.008⟩. ⟨hal-00848482⟩

Share

Metrics

Record views

516

Files downloads

252