Submission + - Claim: Cloud Computing is NP-Complete (f5.com) 1
Random Feature writes: If clouds are built from NP-complete algorithms then clouds are themselves NP-complete. Which means Brewer's CAP theorem will always be true and you can never reach 100% availability or consistency and we should just stop trying. Side effect — wouldn't that also mean the Internet is NP-complete as it relies upon networking algorithms almost all of which are NP-complete problems?