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.
Recommendations
Cited in
(14)- An arithmetic analysis of closed surfaces
- Undecidability of the Spectral Gap
- Entire functions with undecidable arithmetic properties
- On the undecidability of Markov properties for Lie superalgebras
- 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
- On the complexity of isomorphism problems for tensors, groups, and polynomials. I: Tensor isomorphism-completeness
- On the width of complicated JSJ decompositions
- The mathematics of adversarial attacks in AI -- why deep learning is unstable despite the existence of stable neural networks
- The isomorphism problem of projective schemes and related algorithmic problems
- Tropical varieties for exponential sums
- Undecidability in physics: a review
- 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)
