Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

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

inglise keel
2026-03-21
134,72 € 224,53 €

-40% koodiga BOOKS

Meie tarnija laos

Saadetis 15-21 tööpäeva jooksul

30-päevane tagastamisõigus

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 ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Kirjastaja OmniScriptum
Väljalaskeaasta 2026
Kaanetüüp Pehme kaanega
EAN 9786130205133
Kirjuta oma arvustus
Te vaatate: Computability: Computability theory, Computer science, Mathematical logic, Turing machine, Automata theory, Hypercomputation, Computational complexity theory, Parallel computing, Halting problem
Teie hinnang:

Goodreads'i arvustused

134,72 € 224,53 €