so they can use your content to promote their service. Is this really something you would agree with? Seeing your photos on the gdrive login-page to promote the service?
and no problem with an operation system and other software which gets worse and worse over time. A fixed system, that just works... okay, its not quite true for the latest consoles, but the situation is still much worse on the PC.
i think, the decision problem can be much easier in some cases, but the crux is, you can always construct a counter example for each shortcut-version.
the problem of solving a optimization with decisions depends on the output you want to get. solving the exact optimization on the reals with a decision tree is not possible, but finding the least integer is simple with a NDTM, you just try each integer and your NTDM will solve the problem after m iterations, when m is the solution.
But as you already said, this problem depends on many other factors, and the winning program will be some approximation anyway.
as long as its done by javascript, which comes from this site, they may replace the javascript with a logging version. so you cannot win without using a trusted program (which should be installed locally, so nobody can secretly replace it).
Of course a copycat can be minimum efford maximum profit in a simplified model, but this strongly depends on the calculation of the fitness-function. I think it can be hard to match the real world fitness-function, because some of the factors that are relevant to an actual user are hard to calculate.
lets assume an attacker has the server under his control. he will not only be able to modify the scripts to send the content of the decrypted paste back, he can even send the entered password to the server.
so its still more insecure than crypting off-browser and pasting it then. But better an encryption, which is secure most the time, than no attempt at all. You can just not guarantee, it will be encrypted or safe. So do not use it, if you know better. But encourage people who have the options to use it or do not encrypt at all, to use it.
interesting point. lets assume, nobody "licensed" my work while it was available as gpl, and then i decide to only distribute it under another license. Can somebody say "hey, it were gpl some time ago"?
when i offer my pictures under some conditions, and change the conditions when i notice noone is buying them with the old conditions, you could not insist on buying them under the old conditions.
And the GPL is only effective, when somebody redistributes the work. So a simple user is not enough, when he's not distributiong the work, because the gpl does not cover usage but distribution.
But i think, most courts would rule in a way, which is intended by the FSF, because its clear what the GPL should do.
wrong. all the authors together can agree to another additional license. Then one of them adds a patch which is only licensed under the new license, and then the current state of the project has only the new license.
i think you can always transform the optimization problem into the decision problem, by asking if there is an solution less than an arbitrary n.
The real question for a NP-hard problem is: Can it be solved by a non-deterministic turing-machine in polynomial time?
There are many Problems, which can not be solved in P, but cannot even be solved in NP, so you need to show it CAN be solved in NP, then its NP-complete.
Or are the additional factors introducing changes, which make it easier to get the optimal solution (i.e because the optimal solution isn't always the shortest)?
so you say, when i write a file (if you want to, with all zeros, but this shouldn't matter for that issue), i can not assume its on the disk like it wrote it?
okay, disk manufacturers say there is a 1e-10 chance or something of a bit not being written correctly, but this is low enough...... to provide that all my files are written the way they should be... one single erase is enough. when one or two bits are left, they cannot contain anything like an evidence, as every evidence clearly needs more than two bit of information.
Slashdot Mirror
so they can use your content to promote their service. Is this really something you would agree with? Seeing your photos on the gdrive login-page to promote the service?
beaming!
Android uses 127.0.0.1 as IP, which was already used by sun a long time ago.
So they in fact DO use sun's ip.
yes/no. You can type it, hit enter and it will download all files. Then it will ask "last chance to stop" and you need to hit enter another time.
so you can download at 0100 and install later.
no, one-letter is to ambigous, because one-letter names are the only ones you can still pronounce right, when you moan them.
the violet is ONLY the default wallpaper, nothing else. the rest is darkbrown, or the light variant which is still light(brown/grey/whatever)
i think you mean either crystal or oxygen, not plasma.
you do not need to restrict the brand android to the handy-os. Android-Apps for PC could just be normal PC-Programs.
ts NAT but not PAT.
and no problem with an operation system and other software which gets worse and worse over time. A fixed system, that just works ...
okay, its not quite true for the latest consoles, but the situation is still much worse on the PC.
i think, the decision problem can be much easier in some cases, but the crux is, you can always construct a counter example for each shortcut-version.
the problem of solving a optimization with decisions depends on the output you want to get. solving the exact optimization on the reals with a decision tree is not possible, but finding the least integer is simple with a NDTM, you just try each integer and your NTDM will solve the problem after m iterations, when m is the solution.
But as you already said, this problem depends on many other factors, and the winning program will be some approximation anyway.
as long as its done by javascript, which comes from this site, they may replace the javascript with a logging version. so you cannot win without using a trusted program (which should be installed locally, so nobody can secretly replace it).
Of course a copycat can be minimum efford maximum profit in a simplified model, but this strongly depends on the calculation of the fitness-function. I think it can be hard to match the real world fitness-function, because some of the factors that are relevant to an actual user are hard to calculate.
where does the decrypting code come from?
lets assume an attacker has the server under his control. he will not only be able to modify the scripts to send the content of the decrypted paste back, he can even send the entered password to the server.
so its still more insecure than crypting off-browser and pasting it then. But better an encryption, which is secure most the time, than no attempt at all. You can just not guarantee, it will be encrypted or safe. So do not use it, if you know better. But encourage people who have the options to use it or do not encrypt at all, to use it.
you can have only one of them:
- no client side scripting
- client side crypting/decrypting
but do not worry, javascript is sandboxed to the site's context.
there is no "you need more ram", but only a "needs at least a ps2". so you do not need to upgrade too often.
interesting point. lets assume, nobody "licensed" my work while it was available as gpl, and then i decide to only distribute it under another license. Can somebody say "hey, it were gpl some time ago"?
when i offer my pictures under some conditions, and change the conditions when i notice noone is buying them with the old conditions, you could not insist on buying them under the old conditions.
And the GPL is only effective, when somebody redistributes the work. So a simple user is not enough, when he's not distributiong the work, because the gpl does not cover usage but distribution.
But i think, most courts would rule in a way, which is intended by the FSF, because its clear what the GPL should do.
wrong. all the authors together can agree to another additional license. Then one of them adds a patch which is only licensed under the new license, and then the current state of the project has only the new license.
i think you can always transform the optimization problem into the decision problem, by asking if there is an solution less than an arbitrary n.
The real question for a NP-hard problem is: Can it be solved by a non-deterministic turing-machine in polynomial time?
There are many Problems, which can not be solved in P, but cannot even be solved in NP, so you need to show it CAN be solved in NP, then its NP-complete.
but is the toad a lawyer?
Or are the additional factors introducing changes, which make it easier to get the optimal solution (i.e because the optimal solution isn't always the shortest)?
why BCC? CC them, so your contact knows, he needs to CC them as well.
show me someone, who says he can do this.
so you say, when i write a file (if you want to, with all zeros, but this shouldn't matter for that issue), i can not assume its on the disk like it wrote it?
okay, disk manufacturers say there is a 1e-10 chance or something of a bit not being written correctly, but this is low enough ... ... to provide that all my files are written the way they should be ... one single erase is enough. when one or two bits are left, they cannot contain anything like an evidence, as every evidence clearly needs more than two bit of information.
and its quite useless, if you're using a journaled filesystem.