scientific article; zbMATH DE number 545277

Publication date: 10 April 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

primality exponentiation exercises diophantine complexity bounded universal quantifiers diophantine coding Four-Color Problem recursive unsolvability of Hilbert's Tenth Problem universal diophantine equations implications of negative solution to Hilbert's Tenth problem

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Decidability and field theory (12L05) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Decidability of theories and sets of sentences (03B25) Diophantine equations (11D99)

Related Items

The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data ⋮ Diophantine questions in the class of finitely generated nilpotent groups ⋮ Decidability of Univariate Real Algebra with Predicates for Rational and Integer Powers ⋮ On certain biquadratic equations, II ⋮ Unnamed Item ⋮ Semi-Galois categories. II: An arithmetic analogue of Christol's theorem ⋮ Integral points on affine quadric surfaces ⋮ Algebraic degrees of 3-dimensional polytopes ⋮ Hintikka's independence-friendly logic meets Nelson's realizability ⋮ Normal forms for second-order logic over finite structures, and classification of NP optimization problems ⋮ Size-based termination of higher-order rewriting ⋮ Metafinite model theory ⋮ A computational glimpse at the Leibniz and Frege hierarchies ⋮ Complexity in Young's lattice ⋮ The computational power of enzymatic numerical P systems working in the sequential mode ⋮ Bisimilarity of Diagrams ⋮ On the computability of Nash equilibria ⋮ Computing the exact number of periodic orbits for planar flows ⋮ Turing reducibility in the fine hierarchy ⋮ Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines ⋮ Undecidable problems in quantum field theory ⋮ The Diophantine problem for systems of algebraic equations with exponents ⋮ Formal and Natural Proof: A Phenomenological Approach ⋮ Polynomial Equations over Finite, Discrete-Time Dynamical Systems ⋮ Bracket words: A generalisation of Sturmian words arising from generalised polynomials ⋮ Employing the cloud for finding solutions to large systems of nonlinear equations ⋮ A short note on Layman permutations ⋮ Complexity of optimizing over the integers ⋮ Symmetry of eigenvalues of Sylvester matrices and tensors ⋮ Existential Definability over the Subword Ordering ⋮ Reverse engineered Diophantine equations ⋮ Authentication schemes from actions on graphs, groups, or rings ⋮ Tree Automata for Non-linear Arithmetic ⋮ Unnamed Item ⋮ Complexity of \(\Sigma^0_n\)-classifications for definable subsets ⋮ Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups ⋮ Extendability of continuous maps is undecidable ⋮ Intelligent Instantiation and Supersafe Rules ⋮ Diophantine sets of representations ⋮ Isomorphisms of scattered automatic linear orders ⋮ Constraint Satisfaction Problems over Numeric Domains ⋮ Padovan-like sequences and Bell polynomials ⋮ Extensions of Hilbert’s Tenth Problem: Definability and Decidability in Number Theory ⋮ \(\text{NP}\not={co}\)-NP and models of arithmetic ⋮ P, NP, Co-NP and weak systems of arithmetic ⋮ Metafinite model theory ⋮ Quasi-interpretations. A way to control resources ⋮ Diophantine equations and the generalized Riemann hypothesis ⋮ Liouville closed \(H\)-fields ⋮ Unnamed Item ⋮ Theories of orders on the set of words ⋮ Unnamed Item ⋮ Uncomputability and undecidability in economic theory ⋮ Frontier between decidability and undecidability: A survey ⋮ Diophantine undecidability of holomorphy rings of function fields of characteristic 0 ⋮ Definability and decidability in infinite algebraic extensions ⋮ The SAGEX review on scattering amplitudes Chapter 4: Multi-loop Feynman integrals ⋮ Symbolic computation in Maude: some tapas