|
This article is cited in 23 scientific papers (total in 24 papers)
Diophantine representation of enumerable predicates
Yu. V. Matiyasevich
Abstract:
An example is given of a diophantine relation which has exponential growth. This, together with the well-known results of Martin Davis, Hilary Putnam, and Julia Robinson, yields a proof that every enumerable predicate is Diophantine. This theorem implies that Hilbert's tenth problem is algorithmically unsolvable.
Received: 17.09.1970
Citation:
Yu. V. Matiyasevich, “Diophantine representation of enumerable predicates”, Izv. Akad. Nauk SSSR Ser. Mat., 35:1 (1971), 3–30; Math. USSR-Izv., 5:1 (1971), 1–28
Linking options:
https://www.mathnet.ru/eng/im1910https://doi.org/10.1070/IM1971v005n01ABEH001004 https://www.mathnet.ru/eng/im/v35/i1/p3
|
Statistics & downloads: |
Abstract page: | 870 | Russian version PDF: | 449 | English version PDF: | 32 | References: | 68 | First page: | 3 |
|