Turing degree: Computer Science, Mathematical Logic, Computability Theory, Partially Ordered Set, Turing Reduction, Oracle Machine, Equivalence Relation, Equivalence Class, Many-One Reduction -
-40% koodiga BOOKS
Saadetis 15-21 tööpäeva jooksul
30-päevane tagastamisõigus
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 oft ... Täielik kirjeldus
Võib-olla meeldib sulle ka
Kirjeldus
Lisateave
| Kirjastaja | OmniScriptum |
|---|---|
| Väljalaskeaasta | 2026 |
| Kaanetüüp | Pehme kaanega |
| EAN | 9786130353605 |