Some Notes on Game Bounds

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

Autor: Jorge Nuno Silva

Jazyk:

Vazba: Brožovaná

Vydavatel: Dissertation.Com. - Do Not Use

Dostupnost: Skladem u dodavatele

Odesíláme za 9-15 dnů

453 Kč

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

Informace o knize

Autor

Jorge Nuno Silva

Jazyk

Angličtina

Vazba

Kniha - Brožovaná

Vydáno

1998

Stránek

108

EAN

9781581120219

ISBN

9781581120219

Enbook ID

08743892

Vydavatel

Dissertation.Com. - Do Not Use

Hmotnost

150

Rozměry

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 zajímat

Zákaznicí kteří koupili tuto knihu koupili také

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Nejčastěji hledané

Categories

Authors

Publishers

Produkty

Produkty

Some Notes on Game Bounds

Informace o knize

Kompletní popis

Mohlo by vás zajímat

Zákaznicí kteří koupili tuto knihu koupili také