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

Prices from
201.87

Sponsored links

COMPARE ALL WEBSHOPS (2)

Description

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

Description Description
Product Specifications Product specifications
Related results Related results
Next
Previous

Compare webshops (2)

Sponsored links · Some shops pay us a fee

Sort by:

€ 201.87

€ 201.87

Description (0)

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

Product specifications

Brand OmniScriptum
EAN
  • 9786131161957

OmniScriptum

Rice's Theorem: Computability Theory, Partial Functions, Computable Function, Finite State Machine

€ 145.79
Compare 2 stores 2 stores

OmniScriptum

Smn Theorem: Recursion Theory, Programming Language, Gödel Numbering, Computable Function, Stephen Cole Kleene, Algorithm

€ 145.79
Compare 2 stores 2 stores

OmniScriptum

Coq: Computer Science, Interactive Theorem Proving, Curry-Howard

€ 127.10
Compare 2 stores 2 stores

OmniScriptum

Specker Sequence: Computability Theory, Computable Function

€ 108.41
Compare 2 stores 2 stores
Featured Choice
€ 201.87
To Shop