Halting Problem: Computability theory, Decision problem, Computer program, Alan Turing, Algorithm, Turing machine -
-25% su kodu BOOKS
Pristatymas per 15-21 d.d.
30 dienų grąžinimo politika
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 ... Visas aprašymas
Jums taip pat gali patikti
Aprašymas
Daugiau informacijos
| Leidėjas | OmniScriptum |
|---|---|
| Išleidimo metai | 2026 |
| Viršelio tipas | Minkšti viršeliai |
| EAN | 9786130821272 |