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

Semicomputable Function: Recursion Theory, Partial Function, Computable Function, Automated Theorem Proving, Curry- Howard Correspondence -

Anglų
2026-03-15
233,16 € 310,88 €

-25% su kodu BOOKS

Turime sandėlyje pas mūsų tiekėją

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

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 subset X' ¿ X). If X' = X, then f is called a total function and is equivalent to a function. Partial functions are often used when the exact domain, X' , is not known (e.g. many functions in computability theory).

Daugiau informacijos

Leidėjas OmniScriptum
Išleidimo metai 2026
Viršelio tipas Minkšti viršeliai
EAN 9786131161957
Parašykite savo atsiliepimą
Jūs peržiūrėjote: Semicomputable Function: Recursion Theory, Partial Function, Computable Function, Automated Theorem Proving, Curry- Howard Correspondence
Jūsų įvertinimas:

Goodreads Atsiliepimai

233,16 € 310,88 €