But you’re not going to find any good references, or come to any conclusions, if you stay at this stage.
I think he already came to some conclusions and you already gave some good references (which support some of the conclusions).
For example there are ways of designing hardware which is reliable on the assumption that at most N transistors are corrupt.
Do those methods have names or address problems which have names (like the Byzantine generals problem)?
I think he already came to some conclusions and you already gave some good references (which support some of the conclusions).
Do those methods have names or address problems which have names (like the Byzantine generals problem)?