HNHacker News
TopNewBestAskShowJobs

eieio

3,173 karma · joined December 24, 2011

I build unusual games with big constraints (such as https://en.wikipedia.org/wiki/One_Million_Checkboxes). You can see all my work at https://eieio.games

I'm based in Brooklyn. You can reach me at eieiogames at gmail dot com

alum Jane Street Capital, Recurse Center (F23, W25)

submissionscomments
eieio··on Reginald Braithwaite is a GitHubber
This is probably a really dumb question, but can you explain what a "chocolate-in-my-peanut-butter moment" is? I've never heard a phrase like that.

OT this is awesome. Congrats to both parties, obviously a great choice.

eieio··on Nate Silver Went Against the Grain for Some at The Times
Nate's work was practically the definition of "disruptive" when he started and it's been a joy to follow him over the years. As far as papers go I happen to like the NY Times, so I'm a bit sad to see him go. But I'll gladly follow him no matter where he is. This is definitely much more of a loss for the Times than for Nate.

I'll be curious to see what he says about why he left. It's very easy to imagine several reasons the he found it hard to work for the Times. It was very interesting to me to see how hostile some folks were to him during the 2012 election cycle. He obviously threatened the viability of a great deal of the(mostly useless) political punditry that we see. I think it's hard to separate which parts of that hostility were conscious reactions to a perceived threat and which parts were an unconscious reaction to ideas of how the news should work.

I'm sure Nate will do a great job with ESPN and I hope he likes it more than his time with the Times.

eieio··on FP vs. OO, from the trenches
I do it fairly often depending on the topic. There are topics for which I am more interested in the discussion than in the actual article.

For an article like this I'm split. I'm a passionate programmer and would love to read a good article on the tradeoffs between functional and object-oriented styles. I'd also love to read a good discussion about the two styles.

For some topics, say, a site being down, I don't really care about the discussion in most circumstances.

For many other topics, I'm more interested in a good discussion about the topic than I am in any particular article on the topic. It's harder for me to articulate which topics those are, but I know them when I see them.

eieio··on FP vs. OO, from the trenches
It's definitely a very small post(I expected more when I opened it) but I assumed that people upvoted it because they were interested in the discussion that it would produce. There's definitely plenty to say on the subject of functional vs object-oriented programming, even if this article doesn't happen to say much.
eieio··on Better line numbers for Vim
I went to relative numbering a while ago and I can't go back. It's awesome.

The only problem is that it's new in vim 7.3, so there are times where I'm forced to use an older version of vim and can't use the feature. I'll look up 10 lines, see "583" and automatically hit 583k without thinking. Not a big deal, and of course I can just do 583G to fix my mistake, but it's definitely some combination of funny and irritating.

eieio··on Shuttle - A simple SSH shortcut menu for OS X
You could just make ~/.ssh/config a symlink to your config file in your dropbox folder. No need to put private keys on dropbox.
eieio··on The Top Free-to-Play Monetization Tricks
Some of the tricks in the article are unbelievable.

>At this point the user must choose to either spend about $1 or lose their rewards, lose their stamina (which they could get back for another $1), and lose their progress.

I can't imagine playing a game that threatened to take away my items if I didn't give them money.

eieio··on EJDB: Embedded JSON Database for C/C++, .Net, NodeJS, Python, Lua, Java, Ruby
Personally I'd like to have enough to be allowed to downvote. Not exactly my top priority, but it'd be nice.
eieio··on Ideas on how to improve customer conversion and ease of use
I'm 21 but I have poor eyesight. A footer(or a fixed header, which is my pet peeve) like that is an insta-close for me.

If I'm really interested it's a right click to change the element style to display:none, but even that inspires some resentment in me.

eieio··on How Aziz Ansari Tests Jokes With Analytics
That's too bad, I'm a huge(huuuuuge) Parks and Rec fan, but I happen to also really enjoy some parts of his standup. I think some of his jokes suck, but some of them just crack me up. I watch a lot of standup and while I wouldn't put him at the top of my list, I definitely enjoy him.

Also he has mentioned on one of his AMA's that he loves standup more than acting/anything else so it's too bad that some folks don't like his standup. Oh well, to each their own!

eieio··on How Aziz Ansari Tests Jokes With Analytics
Who are you?

I'm always looking for new standup to watch :)

And separate from that, nice comment. I'll check out Jiro Dreams of Sushi in the near future, sounds like the kind of thing I'd like.

eieio··on A summer job paid tuition back in ’81, but then we got cheap
I'm not sure that the author entered college at 1983 given that he's 48 and 1983 is 30 years ago.

(only posting this comment because yours is good. This topic is, at this point, buried, but I figured I'd post anyway).

eieio··on Sorry, NSA, Terrorists Don't Use Verizon. Or Skype. Or Gmail
The United States has experienced large scale terrorist acts(9/11) and has stopped other terrorist plots since then. Terrorism has claimed significantly more lives than bedbugs, and has also cause tremendous damage to United States infrastructure. I'd also argue that comparing the deaths of folks involved in 9/11 to the deaths that have(n't) been experienced by bedbugs to be both absurd and disrespectful, but that's beside the point.

It's hard for me to believe that you're actually trying to make this argument.

eieio··on Sorry, NSA, Terrorists Don't Use Verizon. Or Skype. Or Gmail
This is so intentionally obtuse that I'm not sure what to say. Let me know when bedbugs conspire with sharks to fly a plane into a building.

I think a great case can be made for the NSA and other agencies spending too much money "fighting terrorism," but there's no reason to hurt that argument with such an absurd stance.

eieio··on Show HN: Hide all Snowden-related HN links with a Greasemonkey script
Well I appreciated your post!

I see your comment without showdead so I think you're good.

eieio··on Show HN: Hide all Snowden-related HN links with a Greasemonkey script
Was this removed from the front page? It was in the top ten maybe 30 minutes ago, and now I can't find it in the first 4 pages...
eieio··on This is a web page
I automatically checked the source after reading "There's not much code on this page at all, just simple markup for paragraphs, hierarchy, and emphasis." Just out of curiousity I guess. It's obviously not a big deal, it's just funny. It's not what I expected.
eieio··on One cost engineers and product managers don't consider
I kept reading but definitely found it annoying.

It also took a few seconds to load and the page scrolled back to the top, causing me to lose my place. Extra annoying.

eieio··on In Head-Hunting, Big Data May Not Be Such a Big Deal
I can't stand the huge fixed header and I'm sad that I'm seeing more and more of them on websites. If I plan on spending any amount of time on a website that has one, I immediately edit the css to add display: none because otherwise it'll drive me crazy.

It's a waste of space and it makes it much much harder for me to read on my laptop. Vertical space is way too valuable to throw away like that.

eieio··on This is a web page
I don't have a problem with it, but it was funny to me that when I viewed the source the first thing that I saw was some javascript.
eieio··on Apple Announces Mac OS X 'Mavericks'
Did I miss something and they've gone back and un-broken spaces/virtual desktops? Or are you talking about multiple monitors?

Obviously multiple monitors have needed a fix for ages but spaces are my pet issue so I have to ask.

eieio··on Negative SEO: Looking for Answers from Google
Separate from the fact that a comparison between sharecropping and developing for Microsoft is absolutely absurd, pretending like the only jobs available in the developer community are dependent on either Google or app stores is ridiculous.

It's not ironic, and it's not true. Being a developer gives more freedom and more pay than the vast majority of jobs. The fact that there are some developer jobs that are gasp dependent on large companies in the field does nothing to change this.

eieio··on Oculus Rift co-founder killed by gang trying to escape police
I'm pretty sure Xanza simply means that Reisse's death is a tragedy, and a conversation about the death of an important member in the developer community is hugely different from an argument about the role of police in our society.

Especially since internet discussions about police often turn into emotionally charged and hateful arguments, I think keeping the discussion focused on Reisse is a very good and respectful request.

eieio··on What does O(log n) mean, exactly?
>So in my opinion while anonymouz is technically correct, it does not make any sense to see it that way.

I absolutely agree, and anonymouz's approach is not how I would approach time complexity. I thought it was an interesting point and so I decided to explain where he was coming from, but practically I don't think it makes any sense.

eieio··on What does O(log n) mean, exactly?
anonymouz's interpretation is bizarre and definitely not how I'd think about the function, I'm just trying to explain where he's coming from.

I don't plan on using the interpretation in the future but it was confusing to me too and I thought it was an interesting thought so I figured I'd attempt to explain.

eieio··on What does O(log n) mean, exactly?
I agree that I rarely find myself asking whether I can represent input as a binary search tree, I just find the binary search tree image a very effective method of demonstrating how logarithms play into this at all. It's an easy example of log n complexity.

That being said I'm not sure how much my speculation is worth here. I'm very comfortable with the idea of log n based complexity and don't remember how it was taught to me in the first place. Given that OP accepted the answer and that it was significantly more votes, it seems that it's helpful for more people.

eieio··on What does O(log n) mean, exactly?
It's the difference between a function taking a list and a function taking a number.

A list's size depends on the number of elements in the list. Adding an element to a list increases the size of the list.

A number's size depends on the number of digits required to express the number. Number++ will always increase the numbers value, but not necessarily the number's size. anonymouz's point is that we should describe f(x)'s runtime in terms of the size of x, not the value of x. While I agree that the natural interpretation is to use x's value when x is a number, and x's size is going to be fixed anyway, f(x) is exponential in relation to x's size and linear in relation to x's value.

Put another way: 4 and 5 have different values, but the same size: we're expressing both with 1 digit. 4 and 10 have different values and different sizes, as we require 2 digits to express 10 and only 1 to express 4. Of course we'd probably be dealing with binary, but it's the same idea.

It's really a question of semantics/how you interpret OP's example and the natural interpretation leads to the function being O(n). However anonymouz makes an interesting point that I hadn't considered before.

eieio··on What does O(log n) mean, exactly?
The function runs in linear time relative to the value of x. However, time complexity refers to the size of the input, not the value. For example, binary search's O(log n) time complexity refers to the number of elements n in a list(n varies with the list's size). x + 1 will always increase the value of x, but not necessarily the size. The size of x is the number of digits in x. f(x) runs once if x=1, ten times if x=10, one hundred times if x=100, etc. So each time x's size increases by 1, f's runtime increases by a factor of 10.

It's a very literal definition of time complexity and it's counterintuitive, but ultimately it does make sense.

eieio··on What does O(log n) mean, exactly?
Yes, you can convert log base x to log base y. However, the point is that if OP is assuming that we're using log base 10, developing an intuitive understanding of why a binary search is O(log n) is significantly harder than if OP knows that we're referring to log base 2.
eieio··on What does O(log n) mean, exactly?
The answer provides an excellent definition and some great examples, but I actually prefer the second answer. I think that when it comes to time complexities, developing an intuitive mapping of solutions to time complexities is important.

Developing a feel for how log(n) tends to emerge in common programming techniques is much more practical than specifically checking your code for situations where "the choice of the next element on which to perform some action is one of several possibilities, and only one will need to be chosen."

That being said, I'm not the OP and it's very possible that the phone book examples are more helpful in developing that understanding for other people.

← PreviousPage 9 of 10Next →