Undecidability through Fourier series

In computability theory a variety of combinatorial systems are encountered (word problems, production systems) that exhibit undecidability properties. Here we seek such structures in the realm of Analysis, more specifically in the area of Fourier Analysis. The starting point is that sufficiently strongly convergent Fourier series give rise to predicates in the sense of first order predicate calculus by associating to any s-ary Fourier series the predicate "the Fourier coefficient with index (n(1), ... , n(s)) is non-zero". We introduce production systems, viewed as counterparts of the combinatorial ones, that generate all recursively enumerable predicates in this way using as tools only elementary operations and functions from classical Analysis. The problem arises how simple such a system may be. It turns out that there is a connection between this question and an as yet unproved conjecture by R. Bilchi. This is discussed in the second half of the paper. (C) 2016 Elsevier B.V. All rights reserved.


Published in:
Annals Of Pure And Applied Logic, 167, 7, 507-524
Year:
2016
Publisher:
Amsterdam, Elsevier Science Bv
ISSN:
0168-0072
Keywords:
Laboratories:




 Record created 2016-07-19, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)