Undecidability through Fourier series
From MaRDI portal
Recursively (computably) enumerable sets and degrees (03D25) Undecidability and degrees of sets of sentences (03D35) Computation over the reals, computable analysis (03D78) Applications of computability and recursion theory (03D80) Calculation of integer sequences (11Y55) Elliptic functions and integrals (33E05) Fourier series and coefficients in several variables (42B05)
Recommendations
Cites work
- A survey on Büchi's problem: new presentations and open problems
- Computability and Noncomputability in Classical Analysis
- Decision problems for differential equations
- scientific article; zbMATH DE number 3131080 (Why is no real title available?)
- scientific article; zbMATH DE number 42574 (Why is no real title available?)
- scientific article; zbMATH DE number 44695 (Why is no real title available?)
- scientific article; zbMATH DE number 949396 (Why is no real title available?)
- scientific article; zbMATH DE number 1909821 (Why is no real title available?)
- scientific article; zbMATH DE number 1909822 (Why is no real title available?)
- scientific article; zbMATH DE number 1909827 (Why is no real title available?)
- scientific article; zbMATH DE number 3283520 (Why is no real title available?)
- Hypercomputation
- Hypercomputation: Philosophical issues
- Some Recursively Unsolvable Problems in Analysis
- Some undecidable problems involving elementary functions of a real variable
- The extended analog computer
- The wave equation with computable initial data such that its unique solution is not computable
- Undecidable propositions by ODE's
- Zwei Unentscheidbare Probleme Der Analysis
Cited in
(3)
This page was built for publication: Undecidability through Fourier series
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q278759)