30% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Some Notes on Game Bounds - Jorge-Nuno O. Silva

English
1998-05-01
€26.33 €37.61

-30% with code BOOKS

In stock at our supplier

Shipping in 10-16 days

30-day return policy

Combinatorial 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 infin ... Full description

You May Also Like

Description

Combinatorial 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.

More Information

Author Jorge-Nuno O. Silva
Publisher Dissertation.Com
Release year 1998
Cover type Softcover
EAN 9781581120219
Write Your Own Review
You're reviewing: Some Notes on Game Bounds
Your Rating:

Goodreads Reviews

€26.33 €37.61