Primes are nonnegative values of a polynomial in 10 variables
From MaRDI portal
Publication:1145721
DOI10.1007/BF01404106zbMath0446.10046MaRDI QIDQ1145721
Publication date: 1981
Published in: Journal of Soviet Mathematics (Search for Journal in Brave)
recursively enumerable set; construction; polynomial with integer coefficients of ten variables; set of all prime numbers
03D80: Applications of computability and recursion theory
03D25: Recursively (computably) enumerable sets and degrees
11A41: Primes
11U99: Connections of number theory and logic
Related Items
Further results on Hilbert's tenth problem, Recent developments in primality proving, Prime representing polynomial
Cites Work
- An unsolvable problem in number theory
- Diophantine Representation of the Set of Prime Numbers
- Hilbert's Tenth Problem is Unsolvable
- Reduction of an arbitrary diophantine equation to one in 13 unknowns
- Unsolvable Diophantine Problems
- Existential Definability in Arithmetic
- Arithmetical problems and recursively enumerable predicates