Channels are queues that carry values and support multiple writers and readers. Channels are created with chan. Values in a channel are stored in a buffer. Buffers are never unbounded and there are several provided buffer types:
biblio.bond
Track your reading journey, join book lists, and earn stamps. Decentralized reading attestation on the AT Protocol.
Channel Surfer - Watch YouTube Like It's Cable TV
Turn your YouTube subscriptions into a 2000s cable TV guide. Flip channels, watch what's on, and relive the golden age of channel surfing.
Introduction to AT Protocol
Walkthrough of the various parts and concepts in Bluesky's AT Protocol (ATProto), the types of servers involved and how it all fits together
Requisite variety and its implications for the control of complex systems
Recent work on the fundamental processes of regulation in biology (Ashby, 1956) has shown the importance of a certain quantitative relation called the law of requisite variety. After this relation had been found, we appreciated that it was related to a theorem in a world far removed from the biological—that of Shannon on the quantity of noise or error that could be removed through a correction-channel (Shannon and Weaver, 1949; theorem 10). In this paper I propose to show the relationship between the two theorems, and to indicate something of their implications for regulation, in the cybernetic sense, when the system to be regulated is extremely complex. Since the law of requisite variety uses concepts more primitive than those used by entropy, I will start by giving an account of that law.
Reading on an e-reader · Standard Reader
Put your unread queue on a Kobo, Kindle or phone as real EPUB files.
LinkedLists
A linked list is a linear data structure where each element is a separate object. Each element (we will call it a node) of a list is comprising of two items - the data and a reference to the next node. The last node has a reference to null. The entry point into a linked list is called the head of the list. It should be noted that head is not a separate node, but the reference to the first node. If the list is empty then the head is a null reference.
More Actors with Tokio
In spring 2021, when I was first submerging into tokio, a colleague and friend mentioned I should ingest this article: Actors with Tokio by Alice Ryhl. And, did I ingest it. To summarize, the article proposes an architectural style which relies on message passing (channels) and inherent parallelism (tasks) as well as concurrency (via async/.await) to neatly and safely structure applications dealing with I/O. But really, go read the article.
Unix system programming in OCaml
Translation by Daniel C. Bünzli, Eric Cooper, Eliot Handelman, Priya Hattiangdi, Thad Meyer, Prashanth Mundkur, Richard Paradies, Till Varoquaux, Mark Wong-VanHaren
Sequential.work — Lexicons for comics on AT Protocol
Shared lexicon schemas for comics on AT Protocol. Webtoons, comic books and comic strips under work.sequential.*
Nagi（ナギ）— やさしい言葉が凪ぐ全肯定SNS
Nagi（ナギ）は、全肯定botたんが言葉を受け止める、AT Protocol上の全肯定SNSです。いいねやフォローを気にせず、自由に気持ちを投稿できます。
Connecting with your readers on Semble [Patterns of Sensemaking #2] - Cosmik Labs
On how the references you make help your writing find its natural audience
IIPC WAC 2024 Presentation: A Conceptual Model of Decentralized Storage for Community-Based Archives
