abraxasz
Joined 15 years ago
Joined 15 years ago
- the consistent lighting part: the guy is making this giant epic thing, so you'd think he would cut himself some slack on what really looks like a detail (I wouldn't have noticed it, especially not in this type of game). And yet, the guy absolutely obsesses over it because, you know, that's how it feels right.
- the 'aging' part, when he explains how he kept upgrading old sprites or levels as his skills improved so they "would match up to his standard".
And the best part is that the guy doesn't come off as being arrogant or anything. Just a dude, making the game he would like to play, and making sure it's as good as he dreams it to be. Inspiring.
Again, I repeat that even before reading the study, I intuitively agreed with their conclusion, but I'm not so sure about their argument to prove it
0) The problem is that FP is not really defined anywhere, or rather, everyone has its own definition. I was wondering about the definition of FP about a month ago, and discussed it with my roommate who's a phd student in programming languages. The conclusion of this 2-hour long conversation was: well FP is kind of a fuzzy concept. The concepts of FP languages, typed languages, static languages, etc.. all tend to conflate. Some people will consider that Scheme, Python, Ruby, Scala, Haskell, OCaml, R are all FP languages. Some will say that only Haskell and OCaml really are. Whatever..
Keeping that in mind, here some attempts at answers:
1) In a very loose sense, I guess that you can say that, and to make it possible, you need some constructs in your language, the minimum requirements being higher order functions, and maybe closures. I'd say that's the minimum, but again I'm no specialist. But then if you want to push this "no globals" moto to its logical extreme, you get to a point where you can't even use a "print" function, since it has some side effects. Haskell does, and solves the problem with monads. But to have monads you need a very particular type system, which leads to the question of wether you need a type system to go FP all the way? I don't know. Someone more knowledgeable should answer that
2) I don't know about hardware. But like I said, FP can deal with state. In fact, even hardcore FP as embodied by Haskell can deal with state. It's not trivial to wrap your head around the concept, but it's worth giving it a shot.
1) The most important criterion for me when looking for a store, is walking distance. I don't want to bike, or drive to the store. So the closest store is almost guaranteed to win my business.
2) The second most important criterion is the price. I'm still a student so I'm a bit careful with my spending. So if a store is much much cheaper, and not too much further, then I might go there when I have big errands to run.
3) I am pretty much insensitive to the layout of the store. I'm already walking 10-15 minutes to get there, so 30 seconds between milk and bread is no problem really
Anyway, my point is that in my case, the reason why the "better" store doesn't win is that I don't really care about the criterion used to define it as "better". So going back to your point, a store doesn't have anything to do to serve my interest other than being close to my apartment and lowering the prices. The rest is almost totally irrelevant to me.
The lineup they have is hilarious. It probably went something like:
- [senate] James, do you think we should end mass surveillance
- [Cole] No
- [senate] Dick, whaddya think?
- [Ledgett] Nope, it's allright
- [senate] Ok, Mark?
- [Giuliano] Meh, nah, I think we're fine
- [senate] Well then, after extensive consultation with all interested parties, blablabla
(I know, I know, it's way overboard, I don't believe it myself, but that's the first thing that came to mind when I read the quote, and I had a good laugh)