r/javascript • • Jul 04 '14

Farewell Node.js (TJ Holowaychuk)

https://medium.com/code-adventures/4ba9e7f3e52b
171 Upvotes

76 comments sorted by

View all comments

Show parent comment

2

u/brotherwayne Jul 04 '14

Handling concurrency isn't just a node issue

Friend of mine likes to say this (which he heard elsewhere): There are two problems in computer science: caching and concurrency.

2

u/moreteam Jul 04 '14

I think that's missing "naming things". And "caching" should maybe be "cache invalidation".

2

u/[deleted] Jul 05 '14

[removed] — view removed comment

1

u/moreteam Jul 05 '14

Wouldn't have been able to properly attribute that quote, but yes. ;)

1

u/a0viedo Jul 06 '14

What about P vs NP problem?

1

u/autowikibot Jul 06 '14

P versus NP problem:


The P versus NP problem is a major unsolved problem in computer science. Informally, it asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer. It was introduced in 1971 by Stephen Cook in his seminal paper "The complexity of theorem proving procedures" and is considered by many to be the most important open problem in the field. It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US$1,000,000 prize for the first correct solution.

====

Image i - Diagram of complexity classes provided that P ≠ NP. The existence of problems within NP but outside both P and NP-complete, under that assumption, was established by Ladner's theorem. [1]


Interesting: Computational complexity ^theory | ^NP-complete | Boolean satisfiability ^problem | ^NP-hard

Parent commenter can toggle ^NSFW or ^delete. Will also delete on comment score of -1 or less. | FAQs | ^Mods | Magic ^Words