The FBI's concerns may be valid, but are moot - just use a human driver.
When I look for a desktop, I expect a basic set of tools to come with it, and design consistency between said tools. KDE seems best in terms of tools (aka desktop accessories if you prefer). Gnome's tools seem like they are chosen by committee, rather than actually designed for that environment.
And yes, desktop environments should include Windows and Macintosh OSX as options.
As long as a company - in this case Google, but any company - can show how their product assists the driver rather than distracting the driver, there really shouldn't be an issue. There will of course be states that want to ban HUDs, but the public will straighten them out over time. So go ahead, Google, convince us that Google Glass will actually help the driver
Strangely, the article says the warrant was granted to the FBI and not the NSA
Link to Original Source
I always wondered why Ad-Aware never checked for that name (it was owned by ADAware, an ADA software site, when I looked at it several years ago). Apparently those two didn't arrive at amicable terms
The question is
I help out with an online forum, we get requests every day from people who requested to delete their accounts and then changed their mind. (Okay, not every day
Conversely, we do have a legal requirement to delete user data upon proper request, we can't just make this option unavailable.
So the option is there and is fairly hard to find (I've never used it myself and can't say how hard it is to actually use), that's the best we can do.
I gather the comment system doesn't like all those symbols. It removed half of my reply. Let me try words
n! is divisible by k for all k less than or equal to n, so n! - k is divisible by k and (if k is not 1) is not prime. So n! - 1 to n! - (n + 1) are two numbers with a difference of n with no primes between them.
The result must show that for any x there are primes p and q with q > p > x and q - p less than 70 million,
May. There is a trivial proof that there exist gaps larger than any given number
Pick any number n. Consider n! (that's "factorial", for the non-mathematicians). Now, n! - 1 might be prime (or not), but as n! is divisible by k for all k x and a prime q > p with q - p = 70 million, not that there will always be a prime within 70 million of x.