Wait, how is that different?
118 karma · joined November 21, 2015
Wait, how is that different?
I watched some random streamer with 3 viewers play Skyrim an hour or so a day for several days, asking him what he liked/disliked about it, before purchasing it.
http://www.texample.net/media/tikz/examples/PNG/hilbert-curv...
This might lead to say
. . . . . . . .
1 . . . . . . 2
4 . . . . . . 3
. . . . . . . .
when
. . . . . . . .
1 . . . . . . 4
2 . . . . . . 3
. . . . . . . .
is more efficient.
Generally speaking, it seems this is basically TSP.
Caveat: Take what I say with a grain of salt; I've never built a game in my life.
An example which may speak to a programmer more: the set of functions which take a 32-bit int as argument and return a 32-bit int, where the operation is composition of functions. The identity is the identity function. Since not all functions are invertible, this monoid is not a group.
Haskell, unfortunately, is still quite opaque to me.
Not to take away from his achievement, but I think it is not stressed enough how much the proof depends on work from previous decades that a priori had nothing to do with Fermat.
That being said, I probably hit StackOverflow at least once a month for my job, and if I'm working on a personal side project it's probably more like once an hour.