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ā

Super-recursive Algorithm: Computability theory, Algorithm, Turing machine -

angļu valoda
2026-05-15
146,80 € 195,73 €

-25% ar kodu BOOKS

Piegādātāja noliktavā

Piegāde 15-21 darba dienu laikā

30 dienu atgriešanas politika

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computability theory, super-recursive algorithms are a generalization of ordinary algorithms that are more powerful, that is, compute more than Turing machines. The term was introduced by Mark Burgin, whose book "Super-recursive algorithms" develops their theory and presents sev ... Pilns apraksts

Jums varētu patikt arī

Aprašymas

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computability theory, super-recursive algorithms are a generalization of ordinary algorithms that are more powerful, that is, compute more than Turing machines. The term was introduced by Mark Burgin, whose book "Super-recursive algorithms" develops their theory and presents several mathematical models. Turing machines and other mathematical models of conventional algorithms allow researchers to find properties of recursive algorithms and their computations. In a similar way, mathematical models of super-recursive algorithms, such as inductive Turing machines, allow researchers to find properties of super-recursive algorithms and their computations.

Vairāk informācijas

Izdevējs OmniScriptum
Izlaides gads 2026
Vāka tips Mīkstais vāks
EAN 9786136260204
Rakstiet savu atsauksmi
Jūs vērtējat: Super-recursive Algorithm: Computability theory, Algorithm, Turing machine
Jūsu novērtējums:

Goodreads atsauksmes

146,80 € 195,73 €