Some Notes on Game Bounds

Silva, Jorge-Nuno O

Omschrijving

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.
Gratis verzending vanaf
€ 19,95 binnen Nederland
Schrijver
Silva, Jorge-Nuno O
Titel
Some Notes on Game Bounds
Uitgever
Dissertation.Com. - Do Not Use
Jaar
1998
Taal
Engels
Pagina's
108
Gewicht
150 gr
EAN
9781581120219
Afmetingen
216 x 140 x 9 mm
Bindwijze
Paperback

U ontvangt bij ons altijd de laatste druk!


Rubrieken

Boekstra