On subrecursive complexity of integration

DOI10.1016/j.apal.2020.102777OpenAlexW2998969982WikidataQ126397962 ScholiaQ126397962MaRDI QIDQ2291373

Ivan Georgiev

Publication date: 30 January 2020

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2020.102777

zbMATH Keywords

integrationcomputable real functionrelative computabilityEuler-Mascheroni constantsubrecursive class \(\mathcal{M}^2\)

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Computation over the reals, computable analysis (03D78)

Cites Work

• Unnamed Item
• Unnamed Item
• The computational complexity of maximization and integration
• Computing power series in polynomial time
• Computational complexity of real functions
• Conditional computability of real functions with respect to a class of operators
• Quadrature formulas obtained by variable transformation
• On Some Computability Notions for Real Functions
• Formula2-computable real numbers
• The Exponentially Convergent Trapezoidal Rule
• On a Relative Computability Notion for Real Functions
• Some subrecursive versions of Grzegorczyk's Uniformity Theorem
• Provability of the pigeonhole principle and the existence of infinitely many primes
• Rudimentary Languages and Second‐Order Logic
• Computability of Real Numbers by Using a Given Class of Functions in the Set of the Natural Numbers