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

Halting Problem: Computability theory, Decision problem, Computer program, Alan Turing, Algorithm, Turing machine -

inglise keel
2026-03-16
146,80 € 195,73 €

-25% koodiga BOOKS

Meie tarnija laos

Saadetis 15-21 tööpäeva jooksul

30-päevane tagastamisõigus

In computability theory, the halting problem is a decision problem which can be stated as follows: given a description of a program, decide whether the program finishes running or will run forever. This is equivalent to the problem of deciding, given a program and an input, whether the program will eventually halt when run with that input, or will run forever. Alan Turing proved in 1936 that a general algor ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

In computability theory, the halting problem is a decision problem which can be stated as follows: given a description of a program, decide whether the program finishes running or will run forever. This is equivalent to the problem of deciding, given a program and an input, whether the program will eventually halt when run with that input, or will run forever. Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist. We say that the halting problem is undecidable over Turing machines. B. Jack Copeland attributes the actual term halting problem to Martin Davis.

Lisateave

Kirjastaja OmniScriptum
Väljalaskeaasta 2026
Kaanetüüp Pehme kaanega
EAN 9786130821272
Kirjuta oma arvustus
Te vaatate: Halting Problem: Computability theory, Decision problem, Computer program, Alan Turing, Algorithm, Turing machine
Teie hinnang:

Goodreads'i arvustused

146,80 € 195,73 €