Some Notes on Game Bounds

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

Autor: Jorge Nuno Silva

Limbă:

Legare: Carte broșată

Editura: Dissertation.Com. - Do Not Use

Disponibilitate: În depozitul extern

Expediem în 9-15 zile

108.07 lei

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

Informații despre carte

Autor

Jorge Nuno Silva

Limbă

engleză

Legare

Carte - Carte broșată

Publicat

1998

Pagini

108

EAN

9781581120219

ISBN

9781581120219

Enbook ID

08743892

Editura

Dissertation.Com. - Do Not Use

Greutate

150

Dimensiuni

141 x 217 x 9

Descriere completă

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.

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Some Notes on Game Bounds

Informații despre carte

Descriere completă

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și