High Quality Content by WIKIPEDIA articles! In mathematics, a Diophantine set of j-tuples of integers is a set S for which there is some polynomial with integer coefficients. Matiyasevich's theorem, published in 1970, states that a set of integers is Diophantine if and only if it is recursively enumerable. A set S is recursively enumerable precisely if there is an algorithm that, when given an integer, eventually halts if that input is a member of S and otherwise runs forever. This means that the concept of general Diophantine set, apparently belonging to number theory, can be taken rather in logical or recursion-theoretic terms. This is far from obvious, however, and represented the culmination of some decades of work.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.