Universal diophantine equation
From MaRDI portal
Cites work
Cited in
(39)- Undecidability and incompleteness in classical mechanics
- My collaboration with Julia Robinson
- The incompleteness of theories of games
- On the computability of Nash equilibria
- Frontier between decidability and undecidability: A survey
- Infiniteness sets of primes, admitting diophantine representations in eight variables
- Definability, decidability, complexity
- Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets
- Uncomputably large integral points on algebraic plane curves?
- Prime representing polynomial
- On a Diophantine representation of the predicate of provability
- The scope of Gödel's first incompleteness theorem
- Diophantine complexity
- Semi-algebraic sets of \(f\)-vectors
- Diophantine representation of the decimal expansions of e and
- Martin Davis and Hilbert's tenth problem
- Mathematical programming: Turing completeness and applications to software analysis
- Linear equations over multiplicative groups, recurrences, and mixing. II
- Constraint satisfaction problems over numeric domains
- Short Presburger Arithmetic Is Hard
- Comparison of max-plus automata and joint spectral radius of tropical matrices
- Diophantine cryptography over infinite groups
- On constructing possibly one-way functions based on the non-decidability of the endomorphism problem in groups
- Knapsack problem for nilpotent groups
- Primality testing
- Undecidable problems in quantum field theory
- The Riemann hypothesis as the parity of special binomial coefficients
- Embedding of provably unsolvable problems into stream ciphers;Встраивание доказуемо неразрешимых задач в шифры гаммирования
- Theoretical computer science: computability, decidability and logic
- Several remarks on tensor rank computation
- Mixed quantifier prefixes over Diophantine equations with integer variables
- Undecidability of polynomial inequalities in subset densities and additive energies
- Any function I can actually write down is measurable, right?
- Constructivity conditions on immune sets
- Undecidability of polynomial inequalities in subset densities and additive energies
- A formal proof of complexity bounds on Diophantine equations
- The wonderful geometry of the Vandermonde map
- What can and cannot be done with Diophantine problems
- Further results on Hilbert's tenth problem
This page was built for publication: Universal diophantine equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3953760)
