I'm happiest working in Unix type environments. And there are plenty of jobs that fit that build and pay well where I live. My previous job I wrote pretty much exculsively in Ruby on Rails. This gig is PHP/Node.JS/High Availabilty web application stuff..
Getting another job, atleast in CT, is not something I worry much about.. I just call up the head hunter I work with say, "new job" and I get a call back with an interview in a few days...
If you're using HTTPS, connection is secured before the GET/whatever is actually sent - so if you're using SSL they can only know which site you're connecting to and not what your requesting..
Unless as the OP pointed out, they're using a forged certificate in which case all bets are off..
There is little difference between what he's suggesting a GUI solves and the equivalnt version in SSH/SCP/rsync, etc....
When you VNC into a host server and us the GUI there, you are limited by the servers connections, which typically tend to be in gigabytes, not kbits. It was simply poorly worded, but anyone who's worked remotely via VNC understands the principle. You use the hosting VNC target to do your heavy network lifting and your local laptop/desktop as a dumb terminal to get you into the host server. It doesn't increase your bandwidth per-se but instead increases the bandwidth available to you while removing your slower local link from the equation.
With qubits you can, in principle, also solve problems (much faster) which are NP-hard (see: http://en.wikipedia.org/wiki/NP-hard), the traveling salesman problem for instance.
I guess it depends on your defintion of "much".
Wikipedia: "Grover's algorithm can also be used to obtain a quadratic speed-up over a brute-force search for a class of problems known as NP-complete"
So perhaps you'll bring some of the smaller cases into the realm of possibility but in the long run, its still exponential...
/usr/local (or/opt if you insist) are quite vital - when I custom compile something for a server, I prefer to keep anything I install completely and 100% separate from the packages that the system install..
Ruby for example, I compile with --prefix=/usr/local/ruby...
I had to custom install node for a production environement recently, --prefix=/usr/local/nodejs...
Should later on I want to replace ruby or node or whatever, its as simple as replacing or removing a single directory rather than trying to separate compiled from packaged. These two are especially good examples because they both have package managers themselves. Since by default they will install relative to the binary for the program, you get all your language-specific packages installed all in the same place.
Download last version with all patches:
Download version since they stopped this practice.
Diff
Write notes what this patch did.
Download next version
Diff
Write notes what this patch did.
You wouldn't have a patch down to the individual features but you'd have a patch set thats alot smaller and enumerable.
Yeah, that's true.
Note: factoring isn't NP-complete! So far there's no reason to believe it's not an "easy" problem, except that we haven't figured out how to do it.
Much like people work under the assumption that factoring is hard, you are working under the assumption that factoring is not NP-Complete. Nobody has proven this either...
Two problems with this:
2. The data center is in a disused nuclear bunker. So you're going to need a hell of a lot of bombing.
Power has to come from somewhere. cutting power plus bombing the road to the datacenter should kill any site being hosted down there sooner or later...
We first need to get BGP on board - only a small percentage of ASNs are announcing both ipv4 and ipv6 space.
If i was supreme dictator of the internet I would tell ARIN that in 7 years, no multihomed ASN renewals would be accepted unless the ASN announces at least one prefix in IPv6.
By doing this you would force the core network infrastructure to begin migrating and userland would eventually follow...
"Exactly. It limits liberalism, because it forces you to share source code."
Your original quote was ""you are only allowed to share source code under strict conditions"" which is *completely* different from the point you're now making.
Secondly, you'll note that you have fewer rights without the GPL then with it. Namely, you have no rights whatsoever. GPL code is still copyrighted code. Do you think you should just be able to steal other peoples work?
The license prohibits liberalness, because you are only allowed to share source code under strict conditions.
What in the hell are you talking about? The GPL restricts your ability to share binary-only versions of your tree. It explicitly requires you to *always* share your source code when you are making a public release. There are no limitations at all.
If they have a draft of what the changes are to be - but they just haven't been finalized(e.g. voted on) yet - then "likely" is a fitting adjective to describe the situation.
If you disagree with Newsweek on something specific, just come out and just say it - don't hide behind brainless FUD.
Suppose you took your main drive and the SSD drive and created a md device out of them. Then the only thing left to explain to the OS would be to favor one space over the other based on frequency of use.
"Caribbean island of Trinidad and Tobago"
There are two islands. Trinidad. and Tobago. And the country is Trinidad and Tobago. But its not just one island.
Since I had to suffer through at least one professor who didn't understand basic complexity theory last night, and I know that Slashdot generally screws it up to.
NP-Hard means that there's no (deterministic) polynomial-time algorithm to solve the games
Sadly, you seem not to understand the term yourself. NP-Hard means that given an efficient (deterministic polynomial-time) algorithm to this problem, one can devise an efficient algorithm for any NP problem, so any problem for which solutions can be verified.
You're wrong too.
Every problem in NP can be solved in polynomial time iif an NP-Complete problem can be solved in polynomial time.
You would literally have to generate universes to generate universes to decrypt via brute force. By our current understanding of reality, impossible is correct, and anything shy of that is literally science ficition.
Where exactly then does Shor's Algorithm get its exponential speedup from classical algorithms?
You don't think someone, given enough time, would be able to brute-force your password? The use of Never in zeppepcs post would imply he means literally NEVER. Not "in a reasonable amount of time" or "within a timeframe that the information stored is still valuable" but NEVER IN ALL TIME!!!
Never eh? Suppose we do this:
Hard Drive A - has your data
Hard Drive B - same size, write random bits to it.
Hard Drive C - A xor B
Now suppose I crush hard drive A and B. Recovering the data is pretty impossible as it could decrypt to anything!
If that division problem was an intermediate result as part of a larger forumla what should it do with not a number when it tries to multiply it by 10 or take an average?
Essentially, Is "Not a Number" an error message or a result?
Slashdot Mirror
I'm happiest working in Unix type environments. And there are plenty of jobs that fit that build and pay well where I live. My previous job I wrote pretty much exculsively in Ruby on Rails. This gig is PHP/Node.JS/High Availabilty web application stuff..
Getting another job, atleast in CT, is not something I worry much about.. I just call up the head hunter I work with say, "new job" and I get a call back with an interview in a few days...
Why would I compromise what makes me happy?
If you're using HTTPS, connection is secured before the GET /whatever is actually sent - so if you're using SSL they can only know which site you're connecting to and not what your requesting..
Unless as the OP pointed out, they're using a forged certificate in which case all bets are off..
There is little difference between what he's suggesting a GUI solves and the equivalnt version in SSH/SCP/rsync, etc....
When you VNC into a host server and us the GUI there, you are limited by the servers connections, which typically tend to be in gigabytes, not kbits. It was simply poorly worded, but anyone who's worked remotely via VNC understands the principle. You use the hosting VNC target to do your heavy network lifting and your local laptop/desktop as a dumb terminal to get you into the host server. It doesn't increase your bandwidth per-se but instead increases the bandwidth available to you while removing your slower local link from the equation.
ssh me@server1 /some/file.txt me@server2:/where/to/put/it
scp
The GUI has nothing to do with the bottleneck you're referring to.
With qubits you can, in principle, also solve problems (much faster) which are NP-hard (see: http://en.wikipedia.org/wiki/NP-hard), the traveling salesman problem for instance.
I guess it depends on your defintion of "much".
Wikipedia: "Grover's algorithm can also be used to obtain a quadratic speed-up over a brute-force search for a class of problems known as NP-complete"
So perhaps you'll bring some of the smaller cases into the realm of possibility but in the long run, its still exponential...
Ruby for example, I compile with --prefix=/usr/local/ruby...
I had to custom install node for a production environement recently, --prefix=/usr/local/nodejs...
Should later on I want to replace ruby or node or whatever, its as simple as replacing or removing a single directory rather than trying to separate compiled from packaged. These two are especially good examples because they both have package managers themselves. Since by default they will install relative to the binary for the program, you get all your language-specific packages installed all in the same place.
You can get less of a megapatch.
Download last version with all patches:
Download version since they stopped this practice.
Diff
Write notes what this patch did.
Download next version
Diff
Write notes what this patch did.
You wouldn't have a patch down to the individual features but you'd have a patch set thats alot smaller and enumerable.
You don't sign/agree to an EULA when you sit down at a slot machine...
Yeah, that's true. Note: factoring isn't NP-complete! So far there's no reason to believe it's not an "easy" problem, except that we haven't figured out how to do it.
Much like people work under the assumption that factoring is hard, you are working under the assumption that factoring is not NP-Complete. Nobody has proven this either...
Two problems with this: 2. The data center is in a disused nuclear bunker. So you're going to need a hell of a lot of bombing.
Power has to come from somewhere. cutting power plus bombing the road to the datacenter should kill any site being hosted down there sooner or later...
We first need to get BGP on board - only a small percentage of ASNs are announcing both ipv4 and ipv6 space.
If i was supreme dictator of the internet I would tell ARIN that in 7 years, no multihomed ASN renewals would be accepted unless the ASN announces at least one prefix in IPv6.
By doing this you would force the core network infrastructure to begin migrating and userland would eventually follow...
Your original quote was ""you are only allowed to share source code under strict conditions"" which is *completely* different from the point you're now making.
Secondly, you'll note that you have fewer rights without the GPL then with it. Namely, you have no rights whatsoever. GPL code is still copyrighted code. Do you think you should just be able to steal other peoples work?
The license prohibits liberalness, because you are only allowed to share source code under strict conditions.
What in the hell are you talking about? The GPL restricts your ability to share binary-only versions of your tree. It explicitly requires you to *always* share your source code when you are making a public release. There are no limitations at all.
Look you son of a bitch... we are almost over 2 Girls 1 Cup.
obligatory xkcd blah blah blah http://xkcd.com/467/
If they have a draft of what the changes are to be - but they just haven't been finalized(e.g. voted on) yet - then "likely" is a fitting adjective to describe the situation.
If you disagree with Newsweek on something specific, just come out and just say it - don't hide behind brainless FUD.
My apologies if you lack a brain.
Suppose you took your main drive and the SSD drive and created a md device out of them. Then the only thing left to explain to the OS would be to favor one space over the other based on frequency of use.
That was before Catroon Wars. In cartoon wars, comedy central censored the scene..
"Caribbean island of Trinidad and Tobago" There are two islands. Trinidad. and Tobago. And the country is Trinidad and Tobago. But its not just one island.
Since I had to suffer through at least one professor who didn't understand basic complexity theory last night, and I know that Slashdot generally screws it up to.
NP-Hard means that there's no (deterministic) polynomial-time algorithm to solve the games
Sadly, you seem not to understand the term yourself. NP-Hard means that given an efficient (deterministic polynomial-time) algorithm to this problem, one can devise an efficient algorithm for any NP problem, so any problem for which solutions can be verified.
You're wrong too.
Every problem in NP can be solved in polynomial time iif an NP-Complete problem can be solved in polynomial time.
There are also decision problems that are NP-Hard but not NP-Complete
Lisa, In this house we obey the laws of thermodynamics!
You would literally have to generate universes to generate universes to decrypt via brute force. By our current understanding of reality, impossible is correct, and anything shy of that is literally science ficition.
Where exactly then does Shor's Algorithm get its exponential speedup from classical algorithms?
You don't think someone, given enough time, would be able to brute-force your password? The use of Never in zeppepcs post would imply he means literally NEVER. Not "in a reasonable amount of time" or "within a timeframe that the information stored is still valuable" but NEVER IN ALL TIME!!!
Never eh? Suppose we do this:
Hard Drive A - has your data
Hard Drive B - same size, write random bits to it.
Hard Drive C - A xor B
Now suppose I crush hard drive A and B. Recovering the data is pretty impossible as it could decrypt to anything!
You've been one time pad'd..
I'll leave it up to the slashdot tifosi to declare how long it would last in a bank vault.
I'll pass....
IEEE 754 explains how to handle NaN: NaN * 10 = NaN. (NaN + 5 + 7) / 3 = NaN.
So its an error message... My point was that the OP was being silly in saying that error messages were completely unnecessary.
If that division problem was an intermediate result as part of a larger forumla what should it do with not a number when it tries to multiply it by 10 or take an average? Essentially, Is "Not a Number" an error message or a result?