I don\'t know if this is a proper question here.
As we know, in the CAP theorem, \"A\" means \"Availability\". On wikipedia, the explanation of \"Availability\" is:
I recommend that you avoid Wikipedia and instead read the definition as provided in the proof by Gilbert and Lynch.
"every request received by a non-failing node in the system must result in a response"
And the related footnote which answers your question
"Brewer originally only required almost all requests to receive a response. As allowing probabilistic availability does not change the result when arbitrary failures occur, for simplicity we are requiring 100% availability"
So if almost all requests receive a response or we allow for arbitrary failures to occur, a system can be considered to have high availability.