> I've been told, but never actually looked it up, that there is a theorem that proves you always have to have at least one single point of failure. In what co

> I've been told, but never actually looked it up, that there is a theorem that proves you always have to have at least one single point of failure. In what context? There's a theorem that arbitrarily-reliable computation can be done with noisy components, as long as the noise is below some threshold (e.g. picture less than 1 error per 10 operations). [1] 1: von Neumann, J. (1956). "Probabilistic Logics and Synthesis of Reliable Organisms from Unreliable Components", in Automata Studies, eds. C. Shannon and J. McCarthy, Princeton University Press, pp. 43–98 http://www.cyclify.com/wiki/images/a/af/Von_Neumann_Probabilistic_Logics_and_the_Synthesis_of_Reliable_Organisms_from_Unreliable_Components.pdf http://www.cyclify.com/wiki/images/a/af/Von_Neumann_Probabil...