Timeline for efficient arithmetic with (short) Conway games?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 7, 2013 at 13:31 | comment | added | Noam Zeilberger | yes, I see now that Conway mentions this in "More Infinite Games" (library.msri.org/books/Book42/files/conway.pdf), though I'm curious as to why there is a valid definition of multiplication for Nimbers/impartial games. | |
| Dec 6, 2013 at 22:55 | comment | added | Michael Albert | Am on the road, so don't have references handy, but just from memory there is no well-defined multiplication for games in general (the multiplication in On Numbers and Games works for an extended field of numbers, but not for all games). | |
| Dec 6, 2013 at 10:12 | comment | added | Noam Zeilberger | I don't have a copy of the book yet, but I see that CGSuite fails evaluating multiplications like "{0|{0|0}} * {0|0}" ('No method "op *" for class CanonicalShortGame.'). Is the general case of arithmetic with short games still open (or known to be hard)? | |
| Dec 5, 2013 at 20:06 | comment | added | Noam Zeilberger | This is great, thanks! I downloaded CGSuite, and will have a look at the book. | |
| Dec 5, 2013 at 20:05 | vote | accept | Noam Zeilberger | ||
| Dec 5, 2013 at 18:09 | history | answered | Michael Albert | CC BY-SA 3.0 |