Eric Brewer
A computer scientist and originator of the CAP theorem, recognized as a leading scholar in the field of distributed systems.
Core Facts
The CAP theorem was proposed by Eric Brewer in 2000 and formally proven by Seth Gilbert and Nancy Lynch in 2002.
The CAP theorem states that a distributed system cannot simultaneously satisfy all three of consistency, availability, and partition tolerance.
The CAP theorem was proposed by Eric Brewer in 2000 and formally proved by Gilbert and Lynch in 2002, stating that a distributed system cannot simultaneously guarantee consistency, availability, and partition tolerance.
Timeline (last 90 days)
The CAP theorem was proposed by Eric Brewer in 2000 and states that a distributed data store can satisfy at most two of consistency, availability, and partition tolerance at the same time.
The CAP theorem was proposed by computer scientist Eric Brewer in 2000 and was later given a rigorous mathematical proof by Seth Gilbert and Nancy Lynch in 2002.
All Facts (5)
The CAP theorem was proposed by Eric Brewer in 2000 and formally proven by Seth Gilbert and Nancy Lynch in 2002.
80%VerifiedThe CAP theorem states that a distributed system cannot simultaneously satisfy all three of consistency, availability, and partition tolerance.
80%VerifiedThe CAP theorem was proposed by Eric Brewer in 2000 and formally proved by Gilbert and Lynch in 2002, stating that a distributed system cannot simultaneously guarantee consistency, availability, and partition tolerance.
65%UnverifiedThe CAP theorem was proposed by Eric Brewer in 2000 and states that a distributed data store can satisfy at most two of consistency, availability, and partition tolerance at the same time.
50%UnverifiedThe CAP theorem was proposed by computer scientist Eric Brewer in 2000 and was later given a rigorous mathematical proof by Seth Gilbert and Nancy Lynch in 2002.
50%