Yes they are, especially when you consider that what he's saying is that Earth has too many people on it. What he wants is to lower life expectancy, so that the world's population will drop back to safe levels.

No, because to properly honor his memory, all articles must reflect on his legacy here. Spelling errors and duplicates must remain for that reason.

It's not until he's long gone that those things can safely go away.

Seeing as GIF (and the LZW compression which was the patented part of it) could be claimed as prior art, I would certainly hope so. Unfortunately, what I've seen of the current patent system still makes me somewhat skeptic about how that would work out.

Crazy it may be, but unfortunately, with the quality of most of the tech reps I've talked with, all too true.

And yet you're still here....

And what does that wireless connection connect to? At some point in the connection, there will always be wires. They're faster and typically more reliable. So even if user devices all connect to the network wirelessly, the access points will almost always be connected phyically somehow.

...but not open source.

Aluminum foil, right?

But then how's Apple going to make its proprietary implementation of the stuff and give it a name?

Don't you mean grammar check?

No, Google's the one with a magical, self driving car nowadays.

Have you ever heard of caching? In theory, if the binary code hasn't changed, then if the NaCl module is cached properly, you'd only have to download it the first time. Of course, you'd have to redownload it anytime it changes on the server, but look at it this way - you get instant access to updates.

And if you read the article, Google's purpose in this is not to create huge, full applications in native code and then run them through the browser, but combine this native calculations with the cloud. In Photoshop, that might mean your computer's GPU handles all the image processing, but all the data to save and export to different formats is sent to the cloud for processing. Or, Google Docs' spreadsheets could offload all the cell formula calculations in native code, rather than sending a request back to the server. The point of this native code is to speed up lots of little actions, not build entire applications.

Nope, and that's why NP-complete problems are currently not calculable (at least not in the true, best case scenario, unless you get really lucky and your algorithm succeeds on an early attempt). The concept of a nondeterministic Turing machine is basically that you have a machine that as it goes along to solve the problem, can instantaneously split itself into multiple copies to try to calculate different paths along the algorithm.

If it helps, picture it like a hypothetical infinite core processor. Every time the algorithm hits a branch (if, switch, that kind of idea), rather than simply choose one of them to follow, it creates a copy of itself on another core and each copy starts going through one of the paths. On our limited and finite machines, this gets impossibly large very quickly (think lots of recursion). So if they really did prove P=NP, that's a major leap for Computer Science. But it's still hard to believe, seeing how many other people have spent so long trying.