Creează un cont pentru a te abona la acest blog și a-i urmări articolele pe pagina Lectură.
-
A summary of Adler and Borys's paper distinguishing enabling from coercive bureaucracy, and the features and factors that drive each form of formalization.
-
Johnson's rule finds the optimal schedule for processing jobs through two machines.
-
A simple Dungeons and Dragons dice roller that grew into an over-engineered Rust tool with a parser, statistics, and a WebAssembly website.
-
The origin story behind Leibniz, a project scheduling tool, and a defense of Gantt charts done well.
-
Building a Mastodon bot in Rust that posts a random interesting integer sequence from the OEIS every few hours to make its entries more discoverable.
-
A discrete dynamical system on integer partitions that converges to triangular shapes, explained with Young diagrams and simulated in Python and BQN.
-
How a recent paper proves Transformer language models are injective as functions from prompts to activations, and can be inverted to reconstruct inputs.
-
Reading notes on Kolmogorov-Arnold Networks, which replace MLP node weights with learnable spline activations on edges, grounded in a representation theorem.
-
Randomness and Uncertainty: from random noise to predictable oscillations via differential equations
Exploring how a differential equation can turn random noise into stable bistable oscillations, replicating Trefethen's experiment in Python with Diffrax.
-
Notes on high reliability organizations, the five traits that let nuclear plants and air traffic control manage risk, and their relevance to robust AI.