Diophantine set: Integer, Diophantine equation, Coefficient, Recursively enumerable set, Hilbert's tenth problem, Pell's equation, Prime number, Gödel numbering - Couverture souple

Couverture souple

ISBN 10 : 6132576339 ISBN 13 : 9786132576330

Editeur : Alphascript Publishing, 2010

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.

Détails de l'édition

• Éditeur: Alphascript Publishing
• Date d'édition: 2010
• Langue: anglais
• ISBN 10: 6132576339
• ISBN 13: 9786132576330
• Reliure: Broché
• Nombre de pages: 84
• Éditeur: Miller Frederic P., Vandome Agnes F., McBrewster John
• Coordonnées du fabricant: non disponible
• Personne responsable: non disponible