If you want only a certain subset of computers in this world to use it, then setup MAC address filtering - that's a bit like having a couple of hefty bouncers standing along side your door pushing people away.
A couple of the stupid bouncers that are trivially fooled by a fake ID, of course.
It is possible to get the best of both worlds with a 1GB system by changing the PAGE_OFFSET #define in include/asm-i386/page.h from 0xC0000000 to 0xB0000000.
There are two lines that need to be changed, right next to each other. Of course, if you do this then only 2.75G of address space will be usable by each process, which might cause problems with a few odd programs. (unlikely) Also, since the performance hits have been reduced recently it probably does not make sense to do this for any case other than 1G.
However, this is nice if you have exactly 1G; it's certainly better than just running with 896M.
I find it very had to believe that it can run faster on a compatibility layer rather than the real thing.
I don't know about this game in particular, but I know that, in Everquest under Cedega, zoning (as in, moving between one region/data file and another) is quite a bit faster than in windows. I'm very often the first person in a group to finish the zoning process, and this is on a machine whose memory and CPU are on the order of three years old.
I don't think that is a problem right now; Sarge is getting a *lot* of attention because it is close to release.
Unstable is probably better than testing for a while after a new release, simply because testing gets almost no attention then, and it is very possible that something like a glibc update in unstable that doesn't propagate to testing to keep even security updates for large parts of testing from occurring.
That is not the case right now; Sarge probably has more attention now than it will when it goes stable.
The strength of RSA keys is based only on the belief that factoring is NP-hard.
Umm... this actually *isn't* generally thought to be true.
It *is* generally thought that factoring is not in P, but since the associated decision problem is in both NP and co-NP, showing it to be NP-hard would imply that NP=co-NP, which would be a result almost as big as resolving P vs. NP.
I can tell you that I know of at least one household (that of my parents) that would like a broadband[1] connection, but can't get it because, despite living in the second largest city in Illinois, in the third largest (by population) metropolitan area in the country, neither DSL (17500 feet from CO) nor cable-internet is available.
The only things that *might* be available are wireless, of which at last check we *might* be on the very edge of two ISPs' coverage areas, although at least one has trees along LOS, and both cost about twice as much for the most basic plan as the cheapest DSL.
WTF? *THIS* is why only 20% of households only have broadband. At the very least, it ain't price; I've seen SBC running promos for their DSL service that would actually be cheaper than the dialup+second phone line we have.
[1] Okay, technically they do have broadband, since technically dialup is broadband, but...
Since e almost certainly has a completely random distribution of digits base ten, 9999999967 is probably the last ten digit prime found in consecutive digits of e.
The biggest beef a lot of us have is the whole issue of the tens of thousands of people who were wrongly prevented from voting because they had the same name as a felon.
Not to mention, this *HASN'T BEEN FIXED*.
Re:Nope, wrong, invalid.. nothing to see here.
on
The End of Encryption?
·
· Score: 2, Informative
In any case, we could use a problem with, say, exponential complexity (in particular, not in NP) such that the reverse is also exponential, but with a larger exponent, such that it would still be exponentially easier to encode than to decode.
Even that wouldn't violate Godwin's law, because it says that the probability *approaches* one.
To violate Godwin's law you need to show that there exists some real number epsilon greater than zero such that the chance that Nazis would be mentioned in an infinitely long thread is greater than epsilon.
In other words, a single infinitely long thread would not suffice, unless there are only finitely many threads.
For example, if you have reached solar escape velocity, it doesn't seem like there would be anything you could do to prevent escape.
I don't think that's correct. One could easily imagine a parabolic path on which some solar sailboat is on, and reducing that velocity to below escape.
It wouldn't work if the boat is far away, but if you couldn't prevent escape if you are above escape velocity then you would have a problem entering any stellar orbit with a sailboat.:-)
In other words, it's not that simple. (unless I'm mistaken!)
This works quite well, right up until one of these humans who doesn't know what they're doing gets infected with one of those viruses and starts spamming everyone with your address in the from field.
Of course it has... but C:CTP is a crappy game compared to Civ3; the windows version at least is filled with bugs and missing trivial features (you run out of money, the game lowers wages, which late in the game causes your cities to revolt) and the AI sucks, at least relative to Civ3 or SMAC (which has been ported, of course, but is now next to impossible to find) or the Civ games.
The saddest part about it is that C:CTP had potential. It would probably be a fairly good game if they'd put as much work into it post release as the Sid Meier crowd puts into their games. It has the addictiveness of the civ games, but that tends to go away when I run into one of the games major bugs.
Please give me a call the day our compilers will be able to transform some poor O(3) algorithm into a nice O(1). I'm very interested.
What's your phone number?
I found it somewhat nontrivial when I took it two years ago, but that was largely because I stayed up until 3:30 or so the night before installing FreeBSD on my machine, so I couldn't quite think clearly.
I'm saying that (10^-16)*(6*10^9) is rather less than one, and I think it is a reasonable assumption that there are fewer groups than there are people in the world.
Slashdot Mirror
How about:
"Critical security updates will be provided on the Windows Update site through June 30, 2006."
For someone who is still using Win98, that's probably the most important support aspect.
It is possible to get the best of both worlds with a 1GB system by changing the PAGE_OFFSET #define in include/asm-i386/page.h from 0xC0000000 to 0xB0000000.
There are two lines that need to be changed, right next to each other. Of course, if you do this then only 2.75G of address space will be usable by each process, which might cause problems with a few odd programs. (unlikely) Also, since the performance hits have been reduced recently it probably does not make sense to do this for any case other than 1G.
However, this is nice if you have exactly 1G; it's certainly better than just running with 896M.
I find it very had to believe that it can run faster on a compatibility layer rather than the real thing.
I don't know about this game in particular, but I know that, in Everquest under Cedega, zoning (as in, moving between one region/data file and another) is quite a bit faster than in windows. I'm very often the first person in a group to finish the zoning process, and this is on a machine whose memory and CPU are on the order of three years old.
I don't think that is a problem right now; Sarge is getting a *lot* of attention because it is close to release.
Unstable is probably better than testing for a while after a new release, simply because testing gets almost no attention then, and it is very possible that something like a glibc update in unstable that doesn't propagate to testing to keep even security updates for large parts of testing from occurring.
That is not the case right now; Sarge probably has more attention now than it will when it goes stable.
The strength of RSA keys is based only on the belief that factoring is NP-hard.
Umm... this actually *isn't* generally thought to be true.
It *is* generally thought that factoring is not in P, but since the associated decision problem is in both NP and co-NP, showing it to be NP-hard would imply that NP=co-NP, which would be a result almost as big as resolving P vs. NP.
Oh, this is actually trivial with a simple OTP...
So, you have a secret message S, and you OTP it with a key K, so the ciphertext C is
C=S xor K
Now, if you want C to decrypt to D, supposing that D is the same size as C, just give them
K'=C xor D
and then
C xor K'= K' xor D xor K'=D
maybe more bloggers should do what somethingawful does.
That is, if the referrer is slashdot, referred gets goatse'ed.
I can tell you that I know of at least one household (that of my parents) that would like a broadband[1] connection, but can't get it because, despite living in the second largest city in Illinois, in the third largest (by population) metropolitan area in the country, neither DSL (17500 feet from CO) nor cable-internet is available.
The only things that *might* be available are wireless, of which at last check we *might* be on the very edge of two ISPs' coverage areas, although at least one has trees along LOS, and both cost about twice as much for the most basic plan as the cheapest DSL.
WTF? *THIS* is why only 20% of households only have broadband. At the very least, it ain't price; I've seen SBC running promos for their DSL service that would actually be cheaper than the dialup+second phone line we have.
[1] Okay, technically they do have broadband, since technically dialup is broadband, but...
Since e almost certainly has a completely random distribution of digits base ten, 9999999967 is probably the last ten digit prime found in consecutive digits of e.
Nothing there, though.
The biggest beef a lot of us have is the whole issue of the tens of thousands of people who were wrongly prevented from voting because they had the same name as a felon.
Not to mention, this *HASN'T BEEN FIXED*.
No no no no no no! Your first sentence is wrong! See Wikipedia's complexity article
In any case, we could use a problem with, say, exponential complexity (in particular, not in NP) such that the reverse is also exponential, but with a larger exponent, such that it would still be exponentially easier to encode than to decode.
Even that wouldn't violate Godwin's law, because it says that the probability *approaches* one.
To violate Godwin's law you need to show that there exists some real number epsilon greater than zero such that the chance that Nazis would be mentioned in an infinitely long thread is greater than epsilon.
In other words, a single infinitely long thread would not suffice, unless there are only finitely many threads.
For example, if you have reached solar escape velocity, it doesn't seem like there would be anything you could do to prevent escape.
:-)
I don't think that's correct. One could easily imagine a parabolic path on which some solar sailboat is on, and reducing that velocity to below escape.
It wouldn't work if the boat is far away, but if you couldn't prevent escape if you are above escape velocity then you would have a problem entering any stellar orbit with a sailboat.
In other words, it's not that simple. (unless I'm mistaken!)
Trillian is nice and all, but it does not have UTF-8 support in the free version.
As a gaim user, this pisses me off, because it affects my communications with friends using trillian.
Gaim has no problem with UTF-8, nor does the official client.
Work / Personal only HUMANS get this.
This works quite well, right up until one of these humans who doesn't know what they're doing gets infected with one of those viruses and starts spamming everyone with your address in the from field.
Of course it has... but C:CTP is a crappy game compared to Civ3; the windows version at least is filled with bugs and missing trivial features (you run out of money, the game lowers wages, which late in the game causes your cities to revolt) and the AI sucks, at least relative to Civ3 or SMAC (which has been ported, of course, but is now next to impossible to find) or the Civ games.
The saddest part about it is that C:CTP had potential. It would probably be a fairly good game if they'd put as much work into it post release as the Sid Meier crowd puts into their games. It has the addictiveness of the civ games, but that tends to go away when I run into one of the games major bugs.
As far as I know, in the US in criminal cases the jury is only able to state guilt/innocence.
That is false.
(IANAL, this is not legal advice, etc)
Capitalism has little to do with freedom. The issue here is not one of capitalism, but one of freedom of speech.
I can't even think of software that I could buy for Linux that isn't game related. Is there any?
Mathematica and Matlab both come to mind.
WHERE IS BABBAGE?!
Already inducted, although Boole has not been.
Please give me a call the day our compilers will be able to transform some poor O(3) algorithm into a nice O(1). I'm very interested. What's your phone number?
I found it somewhat nontrivial when I took it two years ago, but that was largely because I stayed up until 3:30 or so the night before installing FreeBSD on my machine, so I couldn't quite think clearly.
I'm saying that (10^-16)*(6*10^9) is rather less than one, and I think it is a reasonable assumption that there are fewer groups than there are people in the world.
They are literally in the top 0.000000000001% of successfull.
No they're not. Shave off a few zeros or the 'literally' and we'll talk.