Some Notes on Game Bounds
Silva, Jorge-Nuno O.
Sold by Ria Christie Collections, Uxbridge, United Kingdom
AbeBooks Seller since 25 March 2015
New - Soft cover
Condition: New
Quantity: Over 20 available
Add to basketSold by Ria Christie Collections, Uxbridge, United Kingdom
AbeBooks Seller since 25 March 2015
Condition: New
Quantity: Over 20 available
Add to basketCombinatorial Games are a generalization of real numbers. Each game has a recursively defined complexity (birthday). In this paper we establish some game bounds. We find some limit cases for how big and how small a game can be, based on its complexity. For each finite birthday, N, we find the smallest positive number and the greatest game born by day N, as well as the smallest and the largest positive infinitesimals. As for each particular birthday we provide the extreme values for those types of games, these results extend those in [1, page 214]. The main references in the theory of combinatorial games are ONAG [1] and WW [2]. We'll use the notation and some fundamental results from WW---mainly from its first six chapters---to establish some bounds to the size of the games.
"About this title" may belong to another edition of this title.
All Returns and Refund are as per Abebooks policies.
Orders usually ship within 2 business days. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required. Thank you!
Order quantity | 4 to 8 business days | 4 to 8 business days |
---|---|---|
First item | £ 0.00 | £ 0.00 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.