
AbstractUsing 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)
Complexity of computation (including implicit computational complexity), complexity bounds, Type-2 theory of effectivity, Higher-type and set recursion theory, Fourier transform, convolution, integrable functions, Theory of numerations, effectively presented structures, computable operators, Constructive and recursive analysis
Complexity of computation (including implicit computational complexity), complexity bounds, Type-2 theory of effectivity, Higher-type and set recursion theory, Fourier transform, convolution, integrable functions, Theory of numerations, effectively presented structures, computable operators, Constructive and recursive analysis
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 9 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
