"Brewer's theorem" meaning in English

{
  "etymology_text": "Named after computer scientist Eric Brewer.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Brewer's theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A theorem stating that it is impossible for a distributed data store to simultaneously provide more than two of three guarantees: consistency (every read receives the most recent write or an error), availability (every request receives a non-error response, without the guarantee that it contains the most recent write), and partition tolerance (the system continues to operate despite an arbitrary number of messages being dropped or delayed between nodes)."
      ],
      "id": "en-Brewer's_theorem-en-name-URRh3Cs2",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "distributed",
          "distributed"
        ],
        [
          "data store",
          "data store"
        ],
        [
          "consistency",
          "consistency"
        ],
        [
          "availability",
          "availability"
        ],
        [
          "partition",
          "partition"
        ],
        [
          "tolerance",
          "tolerance"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A theorem stating that it is impossible for a distributed data store to simultaneously provide more than two of three guarantees: consistency (every read receives the most recent write or an error), availability (every request receives a non-error response, without the guarantee that it contains the most recent write), and partition tolerance (the system continues to operate despite an arbitrary number of messages being dropped or delayed between nodes)."
      ],
      "related": [
        {
          "word": "CAP"
        }
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "CAP theorem"
      ]
    }
  ],
  "word": "Brewer's theorem"
}

{
  "etymology_text": "Named after computer scientist Eric Brewer.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Brewer's theorem",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "related": [
    {
      "word": "CAP"
    }
  ],
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Theory of computing"
      ],
      "glosses": [
        "A theorem stating that it is impossible for a distributed data store to simultaneously provide more than two of three guarantees: consistency (every read receives the most recent write or an error), availability (every request receives a non-error response, without the guarantee that it contains the most recent write), and partition tolerance (the system continues to operate despite an arbitrary number of messages being dropped or delayed between nodes)."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "distributed",
          "distributed"
        ],
        [
          "data store",
          "data store"
        ],
        [
          "consistency",
          "consistency"
        ],
        [
          "availability",
          "availability"
        ],
        [
          "partition",
          "partition"
        ],
        [
          "tolerance",
          "tolerance"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A theorem stating that it is impossible for a distributed data store to simultaneously provide more than two of three guarantees: consistency (every read receives the most recent write or an error), availability (every request receives a non-error response, without the guarantee that it contains the most recent write), and partition tolerance (the system continues to operate despite an arbitrary number of messages being dropped or delayed between nodes)."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "CAP theorem"
      ]
    }
  ],
  "word": "Brewer's theorem"
}