Loading [a11y]/accessibility-menu.js
On the Fourier Representation of Computable Continuous Signals | IEEE Conference Publication | IEEE Xplore

On the Fourier Representation of Computable Continuous Signals


Abstract:

In this paper we study whether it is possible to decide algorithmically if the Fourier series of a continuous function converges uniformly. We show that this decision can...Show More

Abstract:

In this paper we study whether it is possible to decide algorithmically if the Fourier series of a continuous function converges uniformly. We show that this decision cannot be made algorithmically, because there exists no Turing machine that can decide for each and every continuous functions whether its Fourier series converges uniformly. Turing computability describes the theoretical feasible that can be implemented on a digital computer, hence the result shows that there exists no algorithm that can perform this decision.
Date of Conference: 12-17 May 2019
Date Added to IEEE Xplore: 17 April 2019
ISBN Information:

ISSN Information:

Conference Location: Brighton, UK

References

References is not available for this document.