Undecidable problems: a sampler

MaRDI QIDQ3464652zbMATH OpenFDO

Authors Bjorn Poonen

Publication date 27 January 2016

Full work available at URL https://arxiv.org/abs/1204.0299

zbMATH Keywords

undecidabilitydecision problemindependence from axioms

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Undecidability and degrees of sets of sentences (03D35)

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

• scientific article; zbMATH DE number 572102
• scientific article; zbMATH DE number 1972777
• Undecidability in number theory
• scientific article; zbMATH DE number 4031659
• Frontier between decidability and undecidability: A survey

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)