Type‐2 computability on spaces of integrable functions

Mathematical Logic Quarterly 50 (4):417-430 (2004)
  Copy   BIBTEX

Abstract

Using Type‐2 theory of effectivity, we define computability notions on the spaces of Lebesgue‐integrable functions on the real line that are based on two natural approaches to integrability from measure theory. We show that Fourier transform and convolution on these spaces are computable operators with respect to these representations. By means of the orthonormal basis of Hermite functions in L2, we show the existence of a linear complexity bound for the Fourier transform. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

Categories

Keywords

Reprint years

DOI

10.1002/malq.200310109

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 105,289

External links

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

Through your library

My notes

Similar books and articles

Effectivity in Spaces with Admissible Multirepresentations.Matthias Schröder - 2002 - Mathematical Logic Quarterly 48 (S1):78-90.
Spaces allowing Type‐2 Complexity Theory revisited.Matthias Schröder - 2004 - Mathematical Logic Quarterly 50 (4-5):443-459.
Uniform domain representations of "Lp" -spaces.Petter K. Køber - 2007 - Mathematical Logic Quarterly 53 (2):180-205.
Conditional computability of real functions with respect to a class of operators.Ivan Georgiev & Dimiter Skordev - 2013 - Annals of Pure and Applied Logic 164 (5):550-565.
Effective Fine‐convergence of Walsh‐Fourier series.Takakazu Mori, Mariko Yasugi & Yoshiki Tsujii - 2008 - Mathematical Logic Quarterly 54 (5):519-534.
Computational complexity on computable metric spaces.Klaus Weirauch - 2003 - Mathematical Logic Quarterly 49 (1):3-21.
On the convergence of Fourier series of computable Lebesgue integrable functions.Philippe Moser - 2010 - Mathematical Logic Quarterly 56 (5):461-469.
Computing the complexity of the relation of isometry between separable Banach spaces.Julien Melleray - 2007 - Mathematical Logic Quarterly 53 (2):128-131.
Computability and continuity in metric partial algebras equipped with computability structures.Fredrik Dahlgren - 2004 - Mathematical Logic Quarterly 50 (4-5):486-500.
Nonstandard Representation Theory of Standard Operators Defined on the Space of Bochner Integrable Functions.Laurent Vanderputten - 2002 - Mathematical Logic Quarterly 48 (3):379-390.

Analytics

Added to PP
2013-12-01

Downloads
47 (#520,966)

6 months
14 (#233,138)

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

Computational complexity on computable metric spaces.Klaus Weirauch - 2003 - Mathematical Logic Quarterly 49 (1):3-21.
Lp -Computability.Ning Zhong & Bing-Yu Zhang - 1999 - Mathematical Logic Quarterly 45 (4):449-456.

Add more references