If he lives near Los Angeles, UCode (www.ucode.com) teaches kids how to program through worksheets and exercises. Sounds ideally suited for him. The Ruby programming language is used. Ruby is an excellent choice for an 11 year old, easy to get started and serious enough to do amazing production applications (particularly for the web). There are some great tutorials online including tools to try ruby code (tryruby.org and 19pad.charlie.bz). Code School has a free short course using tryruby: http://www.codeschool.com/courses/try-ruby.
This is not a "cloud" problem. This is a virtual server and image problem. Clouds have nothing to do with virtual servers. If you use a service like NewServers.com, you can get dedicated physical servers for your cloud, on-demand and at hourly prices.
USENET was always a very poor system. It's amazing anybody ever used it. You only receive some of the posts and you never know if your posts are really posted and who sees them. It was always a TREMENDOUSLY flawed system that has no place in even YESTERDAY's internet world. Let alone today's.
When has the last time anybody used USENET for anything remotely serious or even interesting?
Here's the answer. n-1 prisoners can only turn the chalice down. 1 of the prisoners, we'll call him the counter prisoner, turns the chalice up when it's down and adds 1 to his counter.
The counter prisoner can simply wait until he has to turn the chalice up n-1 times and he knows every prisoner has been there if they agree to only turn the chalice down 1 time. But the king can screw with the chalice k+1 times (once to start off and then k times during the fun game he's playing with the prisoners).
These k+1 screw times can be offset by having every prisoner turn the chalice down 2(k+1) + 1 = 2k+3 times. The counter prisoner then has to simply wait until he counts (n-1)*(2k+3) - (k+1) times he has to turn the chalice up and declare "YES," all prisoners have been in the central chamber.
If the king tried to make it seem like less people turned the chalice down by turning it back up right after one of them turned it down, then the counter prisoner would simply only reach (n-1)*(2k+3) - (k+1) counts when all prisoners have stopped turning the chalice down. At this point, the counter prisoner might think that the king did the opposite and turned the chalice down k+1 times, making the lowest possible REAL prisoner count only (n-1)*(2k+3) - 2(k+1) = (n-2)*(2k+3) + 1. This means that, at worst, all prisoners turned down the chalice their maximum number of times except for one prisoner who turned down the chalice only 1 time. So that's good. The counter prisoner counts (n-1)*(2k+3) - (k+1) chalice downs and he is assured every prisoner has been in the central chamber.
Conversely, if the king really did try to make it seem like more people turned the chalice down, when (n-1)*(2k+3) - (k+1) counts were made by the counter prisoner, it could be that the chalice was turned down only (n-1)*(2k+3) - 2(k+1) times by actual prisoners. We're at the second part of the previous paragraph and again the counter prisoner is assured every prisoner has been in the central chamber.
The terms are zero money and an indefinite license for the ridiculous patents. NCR knows they would lose a court case. So by settling this way, they assure Yahoo they won't even try to take them to court.. and they put fear into every other company on the internet.
Now they can say, "Yahoo already realized it was pointless to fight us and they settled."
Slashdot Mirror
If he lives near Los Angeles, UCode (www.ucode.com) teaches kids how to program through worksheets and exercises. Sounds ideally suited for him. The Ruby programming language is used. Ruby is an excellent choice for an 11 year old, easy to get started and serious enough to do amazing production applications (particularly for the web). There are some great tutorials online including tools to try ruby code (tryruby.org and 19pad.charlie.bz). Code School has a free short course using tryruby: http://www.codeschool.com/courses/try-ruby.
This is not a "cloud" problem. This is a virtual server and image problem. Clouds have nothing to do with virtual servers. If you use a service like NewServers.com, you can get dedicated physical servers for your cloud, on-demand and at hourly prices.
USENET was always a very poor system. It's amazing anybody ever used it. You only receive some of the posts and you never know if your posts are really posted and who sees them. It was always a TREMENDOUSLY flawed system that has no place in even YESTERDAY's internet world. Let alone today's. When has the last time anybody used USENET for anything remotely serious or even interesting?
Here's the answer. n-1 prisoners can only turn the chalice down. 1 of the prisoners, we'll call him the counter prisoner, turns the chalice up when it's down and adds 1 to his counter. The counter prisoner can simply wait until he has to turn the chalice up n-1 times and he knows every prisoner has been there if they agree to only turn the chalice down 1 time. But the king can screw with the chalice k+1 times (once to start off and then k times during the fun game he's playing with the prisoners). These k+1 screw times can be offset by having every prisoner turn the chalice down 2(k+1) + 1 = 2k+3 times. The counter prisoner then has to simply wait until he counts (n-1)*(2k+3) - (k+1) times he has to turn the chalice up and declare "YES," all prisoners have been in the central chamber. If the king tried to make it seem like less people turned the chalice down by turning it back up right after one of them turned it down, then the counter prisoner would simply only reach (n-1)*(2k+3) - (k+1) counts when all prisoners have stopped turning the chalice down. At this point, the counter prisoner might think that the king did the opposite and turned the chalice down k+1 times, making the lowest possible REAL prisoner count only (n-1)*(2k+3) - 2(k+1) = (n-2)*(2k+3) + 1. This means that, at worst, all prisoners turned down the chalice their maximum number of times except for one prisoner who turned down the chalice only 1 time. So that's good. The counter prisoner counts (n-1)*(2k+3) - (k+1) chalice downs and he is assured every prisoner has been in the central chamber. Conversely, if the king really did try to make it seem like more people turned the chalice down, when (n-1)*(2k+3) - (k+1) counts were made by the counter prisoner, it could be that the chalice was turned down only (n-1)*(2k+3) - 2(k+1) times by actual prisoners. We're at the second part of the previous paragraph and again the counter prisoner is assured every prisoner has been in the central chamber.
If you're brain is copied to multiple real or virtual humans, what do you feel? do you control all of them at once? Only the first one? What happens?
The terms are zero money and an indefinite license for the ridiculous patents. NCR knows they would lose a court case. So by settling this way, they assure Yahoo they won't even try to take them to court.. and they put fear into every other company on the internet. Now they can say, "Yahoo already realized it was pointless to fight us and they settled."