When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network.
Algebraic Computability and Enumeration Models: Recursion Theory and
- Item No : 176808383085
- Condition : Brand New
- Brand : No brand Info
- Seller : loveourprices2
- Current Bid : US $100.46
-
* Item Description
- Further applications to computing with ultrafilters on sets and Turing degree computability are examined. Functorial models computability is presented with algebraic trees realizing intuitionistic types of models.
★ Recommended Products Related To This Item
♥ Best Selling Products in this category
