20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

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

English
2026-03-15
€248.70 €310.88

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

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 ... Full description

You May Also Like

Description

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).

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786131161957
Write Your Own Review
You're reviewing: Semicomputable Function: Recursion Theory, Partial Function, Computable Function, Automated Theorem Proving, Curry- Howard Correspondence
Your Rating:

Goodreads Reviews

€248.70 €310.88