Some Notes on Game Bounds - Jorge-Nuno O. Silva
-40% koodiga BOOKS
Saadetis 10-16 tööpäeva jooksul
30-päevane tagastamisõigus
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 ... Täielik kirjeldus
Võib-olla meeldib sulle ka
TOP
Determined: The Science of Life Without Free Will
-40% koodiga BOOKS
Meie tarnija laos
TOP
The Light Eaters: How the Unseen World of Plant Intelligence Offers a New Understanding of Life on Earth
-40% koodiga BOOKS
Meie tarnija laos
TOP
Why We Sleep: Unlocking the Power of Sleep and Dreams
-40% koodiga BOOKS
Laos
TOP
The Rise and Fall of the Dinosaurs: A New History of a Lost World
-40% koodiga BOOKS
Meie tarnija laos
TOP
Biology: A Global Approach, Global Edition
Neil Campbell, Rebecca Orr, Lisa Urry, Peter Minorsky, Michael Cain, Jane Reece, Steven Wasserman
-40% koodiga BOOKS
Meie tarnija laos
TOP
Six Not-so-easy Pieces: Einstein's Relativity, Symmetry, and Space-Time
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-40% koodiga BOOKS
Meie tarnija laos
TOP
The Age of Alchemy: How Early Innovators Shaped Modern Chemistry
-40% koodiga BOOKS
Meie tarnija laos
TOP
The Secrets of our DNA: How Genetics has Changed the World
-40% koodiga BOOKS
Meie tarnija laos
TOP
Janeway's Immunobiology
Leslie J. Berg, Kenneth Murphy, Casey Weaver
-40% koodiga BOOKS
Meie tarnija laos
TOP
How to Solve it: A New Aspect of Mathematical Method
-40% koodiga BOOKS
Meie tarnija laos
TOP
Factfulness: Ten Reasons We're Wrong About the World--and Why Things Are Better Than You Think
Ola Rosling, Anna Rosling Rönnlund, Hans Rosling
-40% koodiga BOOKS
Meie tarnija laos
TOP
Why Machines Learn: The Elegant Maths Behind Modern AI
-40% koodiga BOOKS
Meie tarnija laos
TOP
The Feynman Lectures on Physics. The New Millennium Edition
Matthew Sands, Robert Leighton, Richard Feynman
-40% koodiga BOOKS
Meie tarnija laos
TOP
Entangled Life: How Fungi Make Our Worlds, Change Our Minds and Shape Our Futures
-40% koodiga BOOKS
Meie tarnija laos
TOP
Life As No One Knows It: The Physics of Life's Emergence
-40% koodiga BOOKS
Meie tarnija laos
TOP
The Rise and Reign of the Mammals: A New History, from the Shadow of the Dinosaurs to Us
-40% koodiga BOOKS
Meie tarnija laos
TOP
Learn Faster, Perform Better: A Musician's Guide to the Neuroscience of Practicing
-40% koodiga BOOKS
Meie tarnija laos
TOP
The Road to Reality: A Complete Guide to the Laws of the Universe
-40% koodiga BOOKS
Meie tarnija laos
Kirjeldus
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.
Lisateave
| Autor | Jorge-Nuno O. Silva |
|---|---|
| Kirjastaja | Dissertation.Com |
| Väljalaskeaasta | 1998 |
| Kaanetüüp | Pehme kaanega |
| EAN | 9781581120219 |