Undecidable problems: a sampler
From MaRDI portal
Publication:3464652
zbMATH Open1358.03063arXiv1204.0299MaRDI QIDQ3464652FDOQ3464652
Publication date: 27 January 2016
Abstract: After discussing two senses in which the notion of undecidability is used, we present a survey of undecidable decision problems arising in various branches of mathematics.
Full work available at URL: https://arxiv.org/abs/1204.0299
Decidability of theories and sets of sentences (03B25) Undecidability and degrees of sets of sentences (03D35)
Cited In (9)
- An arithmetic analysis of closed surfaces
- Undecidability of the Spectral Gap
- Entire functions with undecidable arithmetic properties
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
- From undecidability of non-triviality and finiteness to undecidability of learnability
- Some notes on a method for proving inequalities by computer
- The isomorphism problem of projective schemes and related algorithmic problems
- Tropical varieties for exponential sums
- Extensions of the natural approach to refinements and generalizations of some trigonometric inequalities
This page was built for publication: Undecidable problems: a sampler
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3464652)
