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

Computability: Computability theory, Computer science, Mathematical logic, Turing machine, Automata theory, Hypercomputation, Computational complexity theory, Parallel computing, Halting problem -

Anglų
2026-03-21
168,40 € 224,53 €

-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.The most widely-studied form of computability is Turing computability, which is computability via a Turing machine. However, many other forms of computability are studied as well. Computability notions weaker than Turing machines are studied in automata theory, while computability n ... 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.The most widely-studied form of computability is Turing computability, which is computability via a Turing machine. However, many other forms of computability are studied as well. Computability notions weaker than Turing machines are studied in automata theory, while computability notions stronger than Turing machines are studied in the field of hypercomputation. Apart from the bare question of what problems can be effectively solved, computer scientists are also interested in the resources, such as time and memory, that are required to solve problems using different models of computation. Models of parallel computation, for example, are of interest for their speed of computation, even though any problem solvable by parallel computation is also solvable by non-parallel computation. The field of computational complexity theory is devoted to the study of the resources used during computations.

Daugiau informacijos

Leidėjas OmniScriptum
Išleidimo metai 2026
Viršelio tipas Minkšti viršeliai
EAN 9786130205133
Parašykite savo atsiliepimą
Jūs peržiūrėjote: Computability: Computability theory, Computer science, Mathematical logic, Turing machine, Automata theory, Hypercomputation, Computational complexity theory, Parallel computing, Halting problem
Jūsų įvertinimas:

Goodreads Atsiliepimai

168,40 € 224,53 €