49 karma · joined March 30, 2009
The fact that they manage to also train to the network to simultaneously perform somewhat complicated tasks is super crazy.
The problem with this is that people only have time to check a limited number of sources. Furthermore, many orders of magnitude more sources means that there are many orders of sources that are dangerously wrong as well. Thus, if someone sees a number articles/tweets/posts/whatever from a variety of people espousing that the Texas church shooter was an antifa commie starting the revolution, they are much more likely to believe it.
On top this, with so many sources, people need methods of filtering, and, of course, one of our primary methods of filtering is to find communities/people we tend to agree with. Thus, the now cliche echo chambers are born. These communities are furthermore highly susceptible to manipulation (see the russian facebook ads).
Furthermore, this makes the system fairly easy to take advantage of. If a number of people that seem unrelated online engage in a coordinated effort to spread a particular message, they can do it with ease, since when you see the same message from multiple, seemingly unrelated sources, you're much more likely to believe it.
So while you're right that we used to rely on gossip and hearsay, simply amplifying the number of sources in no way implies that we're getting a less biased message.
anycommand $(fzf)
Loving Wisp! I've been needing something exactly like it and will definitely be making use of it. So thanks!
Let D be the difference in wealth post-transaction divided by the total. The expected value of D is 1/2. That means that we should expect that one agent will walk away with 75% of the pot and the other with 25%. Thus, although the expected outcome for an agent is 50% of the pot, we're still pretty much guaranteed to get very uneven splits.
Next, note that a person's wealth affects the payout of the next transaction. In other words, the person who takes 25% is almost guaranteed to be able to make less on the next transaction than the person who walked away with 75%. Suppose all our agents start out with 100, and that the 75%/25% splits are guaranteed. If each agent engages in exactly one transaction, then half our agents will have 50 and half will have 150. A 50's next transaction will either be (50, 50) or (50, 150). A 150's next interaction will either be (150, 50) or (150, 150). The expected outcome for (50, 50) is (25, 75). The expected outcome for (50, 150) is (50, 150). The expected outcome for (150, 150) is (225, 75). None of the expected outcomes even things up. It just gets more and more spread out.
> While Sync uses BitTorrent technology, people’s files are not accessible to outsiders. Only those who have the unique private key can access the shared folder.
>
> “All the traffic is encrypted using a private key derived from the shared secret. Your files can be viewed and received only by the people with whom you share your private secret,” BitTorrent explains.
>The emphasis is more on computation than on theory.
That's grade school mathematics in a nut shell.
There are O(V!) possible paths. Assuming binary search actually halves the search space each iteration, it will run in O(log(V!)) = O(log(n(n-1)...*1)) = O(log(n) + log(n-1) + ... + log(1)), which is clearly polynomial.