Join 📚 Kevin's Highlights

A batch of the best highlights from what Kevin's read, .

In [theoretical computer science](https://en.wikipedia.org/wiki/Theoretical_computer_science), the **CAP theorem**, also named **Brewer's theorem** after computer scientist [Eric Brewer](https://en.wikipedia.org/wiki/Eric_Brewer_(scientist)), states that any [distributed data store](https://en.wikipedia.org/wiki/Distributed_data_store) can provide only [two of the following three](https://en.wikipedia.org/wiki/Trilemma) guarantees: [Consistency](https://en.wikipedia.org/wiki/Consistency_model) Every read receives the most recent write or an error. [Availability](https://en.wikipedia.org/wiki/Availability) Every request receives a (non-error) response, without the guarantee that it contains the most recent write. [Partition tolerance](https://en.wikipedia.org/wiki/Network_partitioning) The system continues to operate despite an arbitrary number of messages being dropped (or delayed) by the network between nodes.

CAP theorem

wikipedia.org

A knowledge graph is made up of three main components: nodes, edges, and labels. Any *object*, *place*, or *person* can be a **node**. An **edge** defines the *relationship* between the nodes. For example, a node could be a client, like IBM, and an agency like, Ogilvy. An edge would be categorize the relationship as a customer relationship between IBM and Ogilvy. A represents the subject, B represents the predicate, C represents the object

What is a knowledge graph?

ibm.com

Starting Hand Standards A reasonable set of opening requirements at most tables would be as follows: **Early position**: Ten high or better badugis; Smooth 7 high tris or better **Hijack**: Jack high or better badugis, Smooth 8 high tris or better **Cut-off**:  All badugis, 8 high tris or better, A2 and A3 **Button**: All badugis, 9 high tris or better, A2, A3, 23, A4

Badugi Rules and Basic Strategy

countingouts.com

...catch up on these, and many more highlights