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

Lambert M. Surhone (u. a.)

ISBN 10: 613035360X / ISBN 13: 9786130353605

Published by OmniScriptum, 2026

About this Item

Turing degree | Computer Science, Mathematical Logic, Computability Theory, Partially Ordered Set, Turing Reduction, Oracle Machine, Equivalence Relation, Equivalence Class, Many-One Reduction | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130353605 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.

Seller Inventory # 113214581

Bibliographic Details

• Title: Turing degree | Computer Science, Mathematical Logic, Computability Theory, Partially Ordered Set, Turing Reduction, Oracle Machine, Equivalence Relation, Equivalence Class, Many-One Reduction
• Publisher: OmniScriptum
• Publication Date: 2026
• Language: English
• ISBN 10: 613035360X
• ISBN 13: 9786130353605
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 6D millimeters 220 millimeters width by 150 millimeters height by 6 millimeters depth
• Weight: 155 grams
• Seller catalogs:
  • Bücher

About this title

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.