Turing degree: Computer Science, Mathematical Logic, Computability Theory, Partially Ordered Set, Turing Reduction, Oracle Machine, Equivalence Relation, Equivalence Class, Many-One Reduction - Couverture souple

 
9786130353605: Turing degree: Computer Science, Mathematical Logic, Computability Theory, Partially Ordered Set, Turing Reduction, Oracle Machine, Equivalence Relation, Equivalence Class, Many-One Reduction
Couverture souple
ISBN 10 : 613035360X ISBN 13 : 9786130353605
Editeur : Betascript Publishing, 2010

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science and mathematical logic the Turing degree or degree of unsolvability of a set of natural numbers measures the level of algorithmic unsolvability of the set. The concept of Turing degree is fundamental in computability theory, where sets of natural numbers are often regarded as decision problems; the Turing degree of a set tells how difficult it is to solve the decision problem associated with the set.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Éditeur
Betascript Publishing
Date d'édition
2010
Langue
anglais
ISBN 10 
613035360X
ISBN 13 
9786130353605
Reliure
Broché
Nombre de pages
92
Éditeur
Surhone Lambert M., Tennoe Mariam T., Henssonow Susan F.
Coordonnées du fabricant
non disponible
Personne responsable
non disponible