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

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

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Editore
Betascript Publishing
Data di pubblicazione
2010
Lingua
Inglese
ISBN 10 
613035360X
ISBN 13 
9786130353605
Rilegatura
Copertina flessibile
Numero di pagine
92
Redattore
Surhone Lambert M., Tennoe Mariam T., Henssonow Susan F.
Contatto del produttore
non disponibile
Persona responsabile
non disponibile