Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval

DOI10.1016/S0304-3975(99)00139-5MaRDI QIDQ1589441zbMATH OpenFDO

Authors E. Moutai, Salah Labhalla, Henri Lombardi

Publication date 12 December 2000

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

metric spacesreal functionsTuring machineBoolean circuit

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Complexity theory of (functions on) compact metric spaces
• Computational complexity on computable metric spaces
• A tutorial on computable analysis
• Computability on computable metric spaces
• Complexity theory for spaces of integrable functions

Cites work

• scientific article; zbMATH DE number 3871350 (Why is no real title available?)
• scientific article; zbMATH DE number 3824308 (Why is no real title available?)
• scientific article; zbMATH DE number 3900744 (Why is no real title available?)
• scientific article; zbMATH DE number 4002093 (Why is no real title available?)
• scientific article; zbMATH DE number 4023258 (Why is no real title available?)
• scientific article; zbMATH DE number 4050200 (Why is no real title available?)
• scientific article; zbMATH DE number 4070894 (Why is no real title available?)
• scientific article; zbMATH DE number 3720907 (Why is no real title available?)
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 3469437 (Why is no real title available?)
• scientific article; zbMATH DE number 3621713 (Why is no real title available?)
• scientific article; zbMATH DE number 826822 (Why is no real title available?)
• scientific article; zbMATH DE number 3258269 (Why is no real title available?)
• scientific article; zbMATH DE number 3291139 (Why is no real title available?)
• A course in constructive algebra
• Computational complexity of real functions
• Computing power series in polynomial time
• Fast Multiple-Precision Evaluation of Elementary Functions
• Feasible Real Functions and Arithmetic Circuits
• On Relating Time and Space to Size and Depth
• On the definitions of some complexity classes of real numbers
• Rational approximation to \(|x|\)
• Real numbers, continued fractions and complexity classes
• Recursive analysis
• Satisfiability Is Quasilinear Complete in NQL

Cited in

(7)

• Computational complexity on computable metric spaces
• Bounded time computation on metric spaces and Banach spaces
• Lipschitz and uniformly continuous reducibilities on ultrametric polish spaces
• Representations and evaluation strategies for feasibly approximable functions
• On the computational complexity of the Dirichlet problem for Poisson's equation
• Complexity theory of (functions on) compact metric spaces
• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy

This page was built for publication: Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589441)