{
"item_title" : "Ordinal Computability",
"item_author" : [" Merlin Carl "],
"item_description" : "Ordinal Computability discusses models of computation obtained by generalizing classical models, such as Turing machines or register machines, to transfinite working time and space. In particular, recognizability, randomness, and applications to other areas of mathematics are covered.",
"item_img_path" : "https://covers2.booksamillion.com/covers/bam/3/11/049/562/3110495627_b.jpg",
"price_data" : {
"retail_price" : "160.99", "online_price" : "160.99", "our_price" : "160.99", "club_price" : "160.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Overview
Ordinal Computability discusses models of computation obtained by generalizing classical models, such as Turing machines or register machines, to transfinite working time and space. In particular, recognizability, randomness, and applications to other areas of mathematics are covered.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9783110495621
- ISBN-10: 3110495627
- Publisher: de Gruyter
- Publish Date: September 2019
- Dimensions: 9.6 x 6.6 x 1.4 inches
- Shipping Weight: 2.4 pounds
- Page Count: 343
Related Categories
