How can a set of computers agree with eachother if the set size is even or odd?
Project: The Total Library
Project: The Total Library
I'm not sure how to prove it, but I think that to solve this reliably is an NP-Complete problem and practically is useful for new kinds of routing protocols and a foundation for decentralized global democracy more similar to how Wikipedia allows billions of people to agree on many things instead of top down ways of organizing things.
How can a set of computers agree with eachother if the set size is even or odd? How do you scale this up?
How can a set of computers agree with eachother if the set size is even or odd? How do you scale this up?
Thu, Jul 18, 2013 Permanent link
Categories: Communication, democracy, npcomplete
Sent to project: The Total Library
Categories: Communication, democracy, npcomplete
Sent to project: The Total Library
![]() |
RSS for this post |