TY - GEN
T1 - Computability of the Fourier Transform and ZFC
AU - Boche, Holger
AU - Monich, Ullrich J.
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/7
Y1 - 2019/7
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85073159340&partnerID=8YFLogxK
U2 - 10.1109/SampTA45681.2019.9030870
DO - 10.1109/SampTA45681.2019.9030870
M3 - Conference contribution
AN - SCOPUS:85073159340
T3 - 2019 13th International Conference on Sampling Theory and Applications, SampTA 2019
BT - 2019 13th International Conference on Sampling Theory and Applications, SampTA 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 13th International Conference on Sampling Theory and Applications, SampTA 2019
Y2 - 8 July 2019 through 12 July 2019
ER -