News for hackers. Stuff that matters.
Re:Equations True Computer Science Geeks Should (at Least Pr... by king_magic on Monday November 28, 2011 @02:36PM (#3287247)
My response to this is that I am a "true computer science geek". Why isn't P=NP (or P!=NP) on that list? Why not more about set theory? Why not proof by induction? How about lambda calculus?

There is far more to CS than what that list implies. I realize that it's not supposed to be all-encompassing, but seriously, saying it's "something all CS geeks should know", in my mind is unfair - I have little understanding of most of the OP's article, but still consider myself to have a very solid understanding of CS, based on my level of education.

I don't need to know most of the things in the article. There are plenty of other things in CS, however, that I do need to know.

I think putting together lists like this does a disservice to people just about to enter the field. You can't possible break down CS into a list of 11 equations.

Re:Equations True Computer Science Geeks Should (at Least Pr... by kleiba on Wednesday November 30, 2011 @06:13AM (#3294665)
Yeah, you're right. "10 best..." lists are usually B.S. anyway.
Re:Equations True Computer Science Geeks Should (at Least Pr... by munin on Monday November 28, 2011 @02:55PM (#3287324)
y-combinator is on there representing lambda calculus at least ...
Re:Equations True Computer Science Geeks Should (at Least Pr... by king_magic on Monday November 28, 2011 @03:02PM (#3287362)
Good point, I must have missed that one.