The Undecidability of the Existence of Zeros of Real Elementary Functions
From MaRDI portal
Publication:4778269
DOI10.1145/321850.321856zbMath0289.68017WikidataQ60895426 ScholiaQ60895426MaRDI QIDQ4778269
Publication date: 1974
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321850.321856
68W30: Symbolic computation and algebraic computation
65H05: Numerical computation of solutions to single equations
03B25: Decidability of theories and sets of sentences
Related Items
The removal of $\pi $ from some undecidable problems involving elementary functions, Unsolvability of some problems about piecewise-polynomial functions, Deciding first-order formulas involving univariate mixed trigonometric-polynomials, Undecidability and incompleteness in classical mechanics, Dynamical system where proving chaos is equivalent to proving Fermat's conjecture, Solving equations and optimization problems with uncertainty, Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets, The natural algorithmic approach of mixed trigonometric-polynomial problems, Quasi-decidability of a fragment of the first-order theory of real numbers, Fermat's last theorem and chaoticity, Some notes on a method for proving inequalities by computer
