Recursive Languages and Sets: Computability Theory, Algorithm, Decision Problem, String, Alphabet, Halting Computable Function, Indicator ... Number, Pairing Empty Set, Image

Prices from
201.87

Featured

COMPARE ALL WEBSHOPS (2)

Description

Amazon Pages: 180, Paperback, Betascript Publishers
Description Description
Product Specifications Product specifications
Related results Related results
Next
Previous

Compare webshops (2)

Shop
Price
Amazon Logo
€ 201.87
To Shop
Amazon Marketplace Logo
€ 201.87
To Shop
Description (1)

Pages: 180, Paperback, Betascript Publishers

Product specifications

Brand Betascript Publishers
EAN
  • 9786130347420

OmniScriptum

Recursive Set: Computability Theory, Set (Mathematics), Natural Number, Algorithm, Recursively Enumerable

€ 145.79
More Information More Info

OmniScriptum

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

€ 127.10
Compare 2 stores 2 stores

Alphascript Publishing

Decision Problem: Computability theory, Computational complexity Formal system, Function problem, Optimization Algorithm,...

€ 127.10
Compare 2 stores 2 stores

OmniScriptum

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

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