Nemokamas pristatymas nuo 29€

  • check 10 + milijonai knygų
  • check Naujienos (kiekvieną dieną)
  • check 1 + mln. klientų mus pasitiki
  • check Geros kainos % Nuolaidos
  • check Nemokamas pristatymas nuo 29 eur

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

Anglų
2026-05-15
146,80 € 195,73 €

-25% su kodu BOOKS

Turime sandėlyje pas mūsų tiekėją

Pristatymas per 15-21 d.d.

30 dienų grąžinimo 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 ... Visas aprašymas

Jums taip pat gali patikti

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.

Daugiau informacijos

Leidėjas OmniScriptum
Išleidimo metai 2026
Viršelio tipas Minkšti viršeliai
EAN 9786136260204
Parašykite savo atsiliepimą
Jūs peržiūrėjote: Super-recursive Algorithm: Computability theory, Algorithm, Turing machine
Jūsų įvertinimas:

Goodreads Atsiliepimai

146,80 € 195,73 €