Fetching the paper…
Reading the bibliography…
In this paper we show that there is no algorithm to decide whether an arbitrarily given polynomial equation $P(z_1,\ldots,z_{52})=0$ (with integer coefficients) over the Gaussian ring $\mathbb Z[i]$ is solvable.
M. Davis, H. Putnam and J. Robinson, The decision problem for exponential diophantine equations
1961
Earlier work this paper cites.
Yu. Matiyasevich, Enumerable sets are diophantine
1970
Earlier work this paper cites.
J. Denef, Hilbert’s Tenth Problem for quadratic rings
1975
Earlier work this paper cites.
N. Cutland, Computability, Cambridge Univ. Press, Cambridge, 1980
1980
Earlier work this paper cites.
J. Denef, Diophantine sets of algebraic integers, II
1980
Cited alongside, same era.
S. P. Tung, On weak number theories
1985
Cited alongside, same era.
T. Pheidas, Hilbert’s Tenth Problem for a class of rings of algebraic integers
1988
Cited alongside, same era.
H. N. Shapiro and A. Shlapentokh, Diophantine relationships between algebraic number fields
1989
Cited alongside, same era.
Z.-W. Sun, Reduction of unknowns in Diophantine representations
1992
Later among the works it cites.
Yu. Matiyasevich, Hilbert’s Tenth Problem, MIT Press, Cambridge, Massachusetts, 1993
1993
Later among the works it cites.
Z.-W. Sun, Further results on Hilbert’s tenth problem
2021
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…