On subrecursive complexity of integration

Annals of Pure and Applied Logic 171 (4):102777 (2020)
  Copy   BIBTEX

Abstract

We consider the complexity of the integration operator on real functions with respect to the subrecursive class M^2 . We prove that the definite integral of a uniformly M^2-computable analytic real function with M^2-computable limits is itself M^2-computable real number. We generalise this result to integrals with parameters and with varying limits. As an application, we show that the Euler-Mascheroni constant is M^2-computable.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Equational derivation vs. computation.W. G. Handley & S. S. Wainer - 1994 - Annals of Pure and Applied Logic 70 (1):17-49.
Subrecursive hierarchies on Scott domains.Karl-Heinz Niggl - 1993 - Archive for Mathematical Logic 32 (4):239-257.
The intrinsic difficulty of recursive functions.F. W. Kroon - 1996 - Studia Logica 56 (3):427 - 454.
On the Structure of Subrecursive Degrees.Sanat K. Basu - 1975 - Journal of Symbolic Logic 40 (1):87-87.
Complexity and sustainability.Jennifer Wells - 2013 - New York: Routledge.

Analytics

Added to PP
2020-01-08

Downloads
11 (#1,113,583)

6 months
3 (#1,002,413)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Some Classes of Recursive Functions.Andrzej Grzegorczyk - 1955 - Journal of Symbolic Logic 20 (1):71-72.
Rudimentary Languages and Second‐Order Logic.Malika More & Frédéric Olive - 1997 - Mathematical Logic Quarterly 43 (3):419-426.
Some subrecursive versions of Grzegorczyk's Uniformity Theorem.Dimiter Skordev - 2004 - Mathematical Logic Quarterly 50 (4-5):520-524.

Add more references