Semicomputable Function: Recursion Theory, Partial Function, Computable Function, Automated Theorem Proving, Curry- Howard Correspondence -
-25% su kodu BOOKS
Pristatymas per 15-21 d.d.
30 dienų grąžinimo politika
High Quality Content by WIKIPEDIA articles! High Quality Content by WIKIPEDIA articles! In computability theory a subfield of computer science a semicomputable function is a partial function f. In mathematics, a partial function from X to Y is a function f: X' ¿ Y, where X' is a subset of X. It generalizes the concept of a function by not forcing f to map every element of X to an element of Y (only some sub ... 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 | 9786131161957 |