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

Prices from
145.79

Featured

COMPARE ALL WEBSHOPS (2)

Description

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

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

Compare webshops (2)

Sort by:

€ 145.79

€ 145.79

Description (0)

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

Product specifications

Brand OmniScriptum
EAN
  • 9786131243431

OmniScriptum

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

€ 145.79
Compare 2 stores 2 stores

OmniScriptum

Reduction (Recursion Theory): Computability Theory, Decision Problems, Computable Set, Reflexive Relation

€ 127.10
Compare 2 stores 2 stores

OmniScriptum

Programming Language for Computable Functions: Functional Programming, Alice (programming language), Caml

€ 145.79
Compare 2 stores 2 stores

OmniScriptum

Church-Turing Thesis: Computability theory (computation), Hypothesis, Effectively calculable, Recursion, Turing machine, Lambda...

€ 168.22
Compare 2 stores 2 stores
Featured Choice
€ 145.79
To Shop