Bezmaksas piegāde pasūtījumiem virs 29€

  • check 10+ miljoni grāmatu
  • check Jaunumi katru dienu
  • check Vairāk nekā 1 miljons klientu mums uzticas
  • check Labas cenas un atlaides
  • check Piegāde visā Eiropā

Truth Table Reduction: Computability Theory, Turing Reduction -

angļu valoda
2026-03-19
157,17 € 224,53 €

-30% ar kodu BOOKS

Piegādātāja noliktavā

Piegāde 15-21 darba dienu laikā

30 dienu atgriešanas politika

High Quality Content by WIKIPEDIA articles! n computability theory, a truth table reduction is a reduction from one set of natural numbers to another. As a "tool", it is weaker than Turing reduction, since not every Turing reduction between sets can be performed by a truth table reduction, but every truth table reduction can be performed by a Turing reduction. For the same reason it is said to be a stronger ... Pilns apraksts

Jums varētu patikt arī

Aprašymas

High Quality Content by WIKIPEDIA articles! n computability theory, a truth table reduction is a reduction from one set of natural numbers to another. As a "tool", it is weaker than Turing reduction, since not every Turing reduction between sets can be performed by a truth table reduction, but every truth table reduction can be performed by a Turing reduction. For the same reason it is said to be a stronger reducibility than Turing reducibility, because it implies Turing reducibility. A weak truth table reduction is a related type of reduction which is so named because it weakens the constraints placed on a truth table reduction, and provides a weaker equivalence classification; as such, a "weak truth table reduction" can actually be more powerful than a truth table reduction as a "tool", and perform a reduction which is not performable by truth table.

Vairāk informācijas

Izdevējs OmniScriptum
Izlaides gads 2026
Vāka tips Mīkstais vāks
EAN 9786131140914
Rakstiet savu atsauksmi
Jūs vērtējat: Truth Table Reduction: Computability Theory, Turing Reduction
Jūsu novērtējums:

Goodreads atsauksmes

157,17 € 224,53 €