Undecidability through Fourier series

DOI10.1016/j.apal.2016.03.001zbMath1403.03064OpenAlexW2308346016MaRDI 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 seriesJacobi theta functionsBüchi's problemrecursively enumerable sets

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Fourier series and coefficients in several variables (42B05) Applications of computability and recursion theory (03D80) Recursively (computably) enumerable sets and degrees (03D25) Elliptic functions and integrals (33E05) Calculation of integer sequences (11Y55) Computation over the reals, computable analysis (03D78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Undecidability through Fourier series