Aaron Mazel-Gee
|
Registered User
|
|
|
Apr 22 |
awarded | ● Popular Question |
|
Apr 17 |
revised |
K(r)-localization and monochromatic layers in the chromatic spectral sequence fixed minor typos in indices |
|
Mar 13 |
comment |
Is there an analog of ‘Directed Graph’ for topological spaces? ncatlab.org/nlab/show/directed+topological+space |
|
Mar 10 |
comment |
Are loop spaces of homotopically equivalent spaces homotopically equivalent? CW complexes are the opposite of "pathological". |
|
Jan 15 |
awarded | ● Civic Duty |
|
Jan 13 |
comment |
Which popular games are the most mathematical? One way to measure the complexity of a game is by declaring that Person 1 is someone who knows only the rules of the game, and that Person n+1 is someone who will beat Person n 90% of the time; then, the complexity is the maximal such chain. I've heard (though I can't remember where) that chess is 5 and go is 9. I'd imagine that this measure of complexity is correlated with how well we can program computers to play the game, although (presumably interestingly, from a psych point of view) there are probably cases where this doesn't match up perfectly. |
|
Jan 6 |
awarded | ● Necromancer |
