Undecidable problems: a sampler

zbMath1358.03063arXiv1204.0299MaRDI QIDQ3464652

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

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

Related Items (8)

On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness ⋮ Some notes on a method for proving inequalities by computer ⋮ Entire functions with undecidable arithmetic properties ⋮ Undecidability of the Spectral Gap ⋮ From undecidability of non-triviality and finiteness to undecidability of learnability ⋮ The isomorphism problem of projective schemes and related algorithmic problems ⋮ Extensions of the natural approach to refinements and generalizations of some trigonometric inequalities ⋮ Tropical varieties for exponential sums

This page was built for publication: Undecidable problems: a sampler