Computability of the Fourier Transform and ZFC

Holger Boche, Ullrich J. Monich

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

In this paper we study the Fourier transform and the possibility to determine the binary expansion of the values of the Fourier transform in the Zermelo-Fraenkel set theory with the axiom of choice included (ZFC). We construct a computable absolutely integrable bandlimited function with continuous Fourier transform such that ZFC (if arithmetically sound) cannot determine a single binary digit of the binary expansion of the Fourier transform at zero. This result implies that ZFC cannot determine for every precision goal a rational number that approximates the Fourier transform at zero. Further, we discuss connections to Turing computability.

Original languageEnglish
Title of host publication2019 13th International Conference on Sampling Theory and Applications, SampTA 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728137414
DOIs
StatePublished - Jul 2019
Event13th International Conference on Sampling Theory and Applications, SampTA 2019 - Bordeaux, France
Duration: 8 Jul 201912 Jul 2019

Publication series

Name2019 13th International Conference on Sampling Theory and Applications, SampTA 2019

Conference

Conference13th International Conference on Sampling Theory and Applications, SampTA 2019
Country/TerritoryFrance
CityBordeaux
Period8/07/1912/07/19

Fingerprint

Dive into the research topics of 'Computability of the Fourier Transform and ZFC'. Together they form a unique fingerprint.

Cite this