But I think the idea is not to damage the train. Also, I was thinking more about the passengers. As they get it for only two seconds, it shouldn't be so bad. Hope the seats are padded!
223 miles per hour is about 300 feet per second. Hence the deceleration is 300 feet per second divide by two seconds, which is 150 feet per second squared, or almost five times the acceleration due to gravity near the earth's surface.
Why would you want to route packets through every city? Why not just do it for each pair of cities?
Actually, that is not the Traveling-Salesman problem, but the shortest (fastest) path problem, which is polynomial. Even solving for every pair of nodes, it's still polynomial.
Whose point? To get a problem of the size that you gave [10^(10^34)] would require 10^32 nodes. What kind of problem would require this? And yes, I've heard of NP Completeness.
Slashdot Mirror
If the craft is falling, then the flow of air will rotate the blades. Not the softest landing, but better than nothing.
Aren't they ActiveX controls of DOM?
Trivium: logic, rhetoric, and grammar
Quadrivium: arithmetic, astronomy, geometry, and music.
So math has two of the liberal arts.
But I think the idea is not to damage the train. Also, I was thinking more about the passengers. As they get it for only two seconds, it shouldn't be so bad. Hope the seats are padded!
223 miles per hour is about 300 feet per second. Hence the deceleration is 300 feet per second divide by two seconds, which is 150 feet per second squared, or almost five times the acceleration due to gravity near the earth's surface.
Yeah, a 9 is about right.
Perhaps both. While UNIX was not designed to be secure, it was designed to be multiuser, which helps with some security issues.
What is the difference between root and admin?
So if have an executable in /home/day/bin (day is my user account), then it isn't installed?
But can an application invoke runas? Is there a Windows analog to setuid?
But Linux is more honest about the difficulty of using a computer.
Hmm... Maybe you should make the local hard drives read-only (or require a better protected password) and have the students store stuff on a server?
Nor the GNOME gnome!
Which PCI cards? My Netgear FA311 works on my Pentium I in both Windows 95 and Linux. Or did you mean older that that?
I do know what it is. I just don't kneel down before it.
Why would you want to route packets through every city? Why not just do it for each pair of cities?
Actually, that is not the Traveling-Salesman problem, but the shortest (fastest) path problem, which is polynomial. Even solving for every pair of nodes, it's still polynomial.
Whose point? To get a problem of the size that you gave [10^(10^34)] would require 10^32 nodes. What kind of problem would require this? And yes, I've heard of NP Completeness.
The members of the Free Software Foundation don't know this, but we've replaced their copies of GNU Emacs with Folger's Crystals Text Editor.
Let's see if they can tell the difference. . .
Would 1,000 cities be a small, trivial size? It would take less than 10^300 attempts.
Well, if there are no objective metrics in choice of language, then why shouldn't one write a kernel in Java?
Also, even if there are no objective metrics, does that mean that there is no basis for "appropriateness" in language choice?
But if you're only solving Travelling salesman problems of a certain size, then that isn't a concern.
Well, should I write this kernel in Java or C?
The grandparent was thinking of "un" as "not". Hence ununhexium is not not hexium, and therefore hexium.
I don't know how fast quantum computers are, but if they are faster than classical computers, one could just bute force it.
Also, others have pointed out that quantum computers can do better approximation of approximation problems.
Randomness does not refer to numbers, but to the means of selection.