Aug 28, 2006 · This paper studies how well computable functions can be approximated by their Fourier series. To this end, we equip the space of Lp-computable functions.
It is shown that whereas for every p>1, the Fourier series of every Lp-computable function f converges to f in the Lp norm, the set of L1-computed functions ...
This paper studies how well computable functions can be approximated by their Fourier series. To this end, we equip the space of Lp-computable functions ...
This paper studies how well computable functions can be approximated by their Fourier series. To this end, we equip the space of Lp-computable functions ...
This paper studies how well computable functions can be approximated by their Fourier series. To this end, we equip the space of Lp-computable functions ...
May 11, 2007 · We study the convergence of Fourier series for Lp-computable functions and show that whereas for every p > 1, the Fourier series of every Lp- ...
ABSTRACT. Lp-computability is defined in terms of effective approximation;. e.g. a function / G Lp[0,1] is called Lp-computable.
Carleson's Theorem states that the Fourier series of any function in Lp[−π, π] converges almost everywhere. We show that the Schnorr random points are precisely ...
May 15, 2019 · Fourier series here given by the same formula: cn=∫e−inxf(x)dx and the statement concludes, that fn=∑n−ncneinx convergers to f in Lp. · They are ...
Missing: Computable | Show results with:Computable
We study the convergence of Fourier series for Lp -computable functions and show that whereas for every p > 1, the Fourier series of every Lp -computable ...