Join 📚 Kevin's Highlights
A batch of the best highlights from what Kevin's read, .
When You’re Reaching Out to a Stranger You Admire
Perhaps it’s someone who works in a relevant department at your dream company. Or, maybe it’s that experienced professional who has a stellar reputation in your field. Either way, you’re eager to establish some sort of connection with this person that you respect—even though you’ve never actually met.
*Hello [Name],*
*I hope you’re having a great week!*
*My name is [Your name], and I work as [Position] at [Company]. I became familiar with your work when [how you discovered this person] and wanted to reach out to tell you how much I admire your [skill or specific experience].*
*If you’re open to it, I’d love to [grab coffee/connect on LinkedIn/other opportunity to get to know each other] to [keep in touch/learn more about your experience].*
*Really looking forward to keeping in touch, [Name]!*
*Best,*
*[Your name]*
4 Email Templates to Make Networking Way Less Awkward
Kat Boogaard
it’s important to realize that **ChatGPT and LaMDA aren’t trained to be correct**.
You can train models that are optimized to be correct—but
that’s a different kind of model.
Models like that are being built now;
they tend to be smaller and trained on specialized data sets
(O’Reilly Media has a search engine that has been trained on the 70,000+ items in our learning platform).
And you could integrate those models with GPT-style language models, so that
one group of models supplies the *facts* and
the other supplies the *language*.
Sydney and the Bard
Mike Loukides
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
...catch up on these, and many more highlights
Readwise