Undecidability through Fourier series

DOI10.1016/j.apal.2016.03.001zbMath1403.03064MaRDI QIDQ278759

Peter Buser, Bruno Scarpellini

Publication date: 2 May 2016

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2016.03.001

zbMATH Keywords

Fourier series; Jacobi theta functions; Büchi's problem; recursively enumerable sets

Mathematics Subject Classification ID

03D35: Undecidability and degrees of sets of sentences

42B05: Fourier series and coefficients in several variables

03D80: Applications of computability and recursion theory

03D25: Recursively (computably) enumerable sets and degrees

33E05: Elliptic functions and integrals

11Y55: Calculation of integer sequences

03D78: Computation over the reals, computable analysis

Cites Work

• A survey on Büchi's problem: new presentations and open problems
• The wave equation with computable initial data such that its unique solution is not computable
• Hypercomputation: Philosophical issues
• The extended analog computer
• Hypercomputation
• Computability and Noncomputability in Classical Analysis
• Decision problems for differential equations
• Some undecidable problems involving elementary functions of a real variable
• Some Recursively Unsolvable Problems in Analysis
• Zwei Unentscheidbare Probleme Der Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item