Some Notes on Game Bounds

Name: Some Notes on Game Bounds
Brand: Dissertation.Com. - Do Not Use
SKU: 9781581120219
Price: 18.75 EUR
Availability: InStock

Autor: Jorge Nuno Silva

Jazyk:

Väzba: Brožovaná

Vydavateľ: Dissertation.Com. - Do Not Use

Dostupnosť: Skladom u dodávateľa

Odosielame za 9-15 dní

18.75 €

Combinatorial Games are a generalization of real numbers. Each game has a recursively defined comple...

Informácie o knihe

Autor

Jorge Nuno Silva

Jazyk

Angličtina

Väzba

Kniha - Brožovaná

Vydalo

1998

Stránok

108

EAN

9781581120219

ISBN

9781581120219

Enbook ID

08743892

Vydavateľ

Dissertation.Com. - Do Not Use

Hmotnosť

150

Rozmery

141 x 217 x 9

Kompletný popis

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.

Mohlo by vás zaujímať

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež

Najčastejšie vyhľadávané

Categories

Authors

Publishers

Produkty

Produkty

Najčastejšie vyhľadávané

Categories

Authors

Publishers

Produkty

Produkty

Some Notes on Game Bounds

Informácie o knihe

Kompletný popis

Mohlo by vás zaujímať

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež