News for hackers. Stuff that matters.

keynan

Re:How Many People Did Nuclear Energy Kill? [video] on Wednesday February 03, 2021 @08:28PM (#26021505)
I agree this is optimal, however politics is a thing and you went and used the word tax.
Maybe next you'd like to guess their star sign
Re:Ask HN: What educational YouTube channels do you watch? on Tuesday September 08, 2020 @09:50AM (#24408303)
3Blue1Brown
Re:Ask HN: Is Ruby on Rails still worth learning? on Monday October 15, 2018 @07:07PM (#18224827)
The question isn't "is it worth learning" it's "is it worth learning next". What do you already know?

Focus on learning theory and standards (e.x. HTTP, websockets, MVC, security principals) and learning tools becomes easy enough you won't bother asking us if it's worth the time investment.

Re:Show HN: Bitbox.co – Cloud Storage for Developers on Wednesday May 09, 2018 @05:59AM (#17028635)
I'd like to have an aws glacier backup tool. I'd expect it to be open source, and be simple enough to read over. If it encrypts and decrypts documents too that's a plus
Pick what your passionate about and learn it deeply. However you would be well advised to take atleased one course on:

- networking, focus TCP - Compilers, focus theory behind lex and yacc, or equivalent - parallel algorithms, focus on lock free and message passing - A.I. focus on or-tree search and genetic emergence. (Not ML, important but that comes later) - functional models of computation and recursion.

Re:Ask HN: Why does P2P encrypted messaging still suck? on Friday April 06, 2018 @01:19PM (#16775067)
That is incorrect. You've just defined P2P such that no commonly accepted P2P application meets it. At a minimum every P2P app you've likely ever heard of or used, baring maybe one exception, has at a minimum used third parties for orchestration.
Re:Ask HN: Which books do you wish you'd read earlier in life? on Thursday February 08, 2018 @11:51PM (#16337960)
btw, Algebra Chapter 0 is excellent
Re:Ask HN: Which books do you wish you'd read earlier in life? on Saturday February 03, 2018 @01:32AM (#16296513)
Capital by picketty, and Dictators handbook
Re:A Solution of the P versus NP Problem? on Tuesday August 15, 2017 @12:04AM (#15015360)
> A plausible proof of "P != NP" won't be quite as simple to express, since it needs to prove that all such algorithms do not run in polynomial time.

That sounds hard but, If for any NP-Complete problem there exists no P solution then for all NP problems there is no P solution. So this proof sounds like it has the right shape.

Anywhere visa is excepted, by which we mean ~half the U.S. because Americans have that much awareness of the rest of the world.
Re:Codecasting on Monday August 31, 2015 @03:34AM (#10145869)
livecoding & twich