<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
    <title>Dimitri Lozeve's Blog</title>
    <subtitle><![CDATA[Recent posts]]></subtitle>
    <link href="https://lozeve.com/atom.xml" rel="self" />
    <link href="https://lozeve.com" />
    <id>https://lozeve.com/atom.xml</id>
    <author>
        <name>Dimitri Lozeve</name>
        
        <email>dimitri+web@lozeve.com</email>
        
    </author>
    <updated>2026-05-27T00:00:00Z</updated>
    <entry>
    <title>Two Types of Bureaucracy: Enabling and Coercive</title>
    <link href="https://lozeve.com/posts/types-of-bureaucracy-enabling-and-coercive.html" />
    <id>https://lozeve.com/posts/types-of-bureaucracy-enabling-and-coercive.html</id>
    <published>2026-05-27T00:00:00Z</published>
    <updated>2026-05-27T00:00:00Z</updated>
    <summary type="html"><![CDATA[A summary of Adler and Borys's paper distinguishing enabling from coercive bureaucracy, and the features and factors that drive each form of formalization.]]></summary>
</entry>
<entry>
    <title>Johnson's Rule: scheduling items in two machines</title>
    <link href="https://lozeve.com/posts/johnsons-rule.html" />
    <id>https://lozeve.com/posts/johnsons-rule.html</id>
    <published>2026-05-19T00:00:00Z</published>
    <updated>2026-05-19T00:00:00Z</updated>
    <summary type="html"><![CDATA[Johnson's rule finds the optimal schedule for processing jobs through two machines. An explanation of the method, its intuition, and code in Python and BQN.]]></summary>
</entry>
<entry>
    <title>Overengineering Dice Rolling</title>
    <link href="https://lozeve.com/posts/diceroll.html" />
    <id>https://lozeve.com/posts/diceroll.html</id>
    <published>2026-05-13T00:00:00Z</published>
    <updated>2026-05-13T00:00:00Z</updated>
    <summary type="html"><![CDATA[A simple Dungeons and Dragons dice roller that grew into an over-engineered Rust tool with a parser, statistics, and a WebAssembly website.]]></summary>
</entry>
<entry>
    <title>Why I built Leibniz: in defense of Gantt charts and project scheduling</title>
    <link href="https://lozeve.com/posts/leibniz-product-vision.html" />
    <id>https://lozeve.com/posts/leibniz-product-vision.html</id>
    <published>2026-05-03T00:00:00Z</published>
    <updated>2026-05-03T00:00:00Z</updated>
    <summary type="html"><![CDATA[The origin story behind Leibniz, a project scheduling tool, and a defense of Gantt charts done well.]]></summary>
</entry>
<entry>
    <title>A Mastodon bot for interesting integer sequences</title>
    <link href="https://lozeve.com/posts/oeis-bot.html" />
    <id>https://lozeve.com/posts/oeis-bot.html</id>
    <published>2026-02-14T00:00:00Z</published>
    <updated>2026-02-14T00:00:00Z</updated>
    <summary type="html"><![CDATA[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.]]></summary>
</entry>
<entry>
    <title>The Bulgarian Solitaire</title>
    <link href="https://lozeve.com/posts/bulgarian-solitaire.html" />
    <id>https://lozeve.com/posts/bulgarian-solitaire.html</id>
    <published>2026-02-08T00:00:00Z</published>
    <updated>2026-02-08T00:00:00Z</updated>
    <summary type="html"><![CDATA[A discrete dynamical system on integer partitions that converges to triangular shapes, explained with Young diagrams and simulated in Python and BQN.]]></summary>
</entry>
<entry>
    <title>Language models are injective and hence invertible</title>
    <link href="https://lozeve.com/posts/language-models-are-injective.html" />
    <id>https://lozeve.com/posts/language-models-are-injective.html</id>
    <published>2025-11-25T00:00:00Z</published>
    <updated>2025-11-25T00:00:00Z</updated>
    <summary type="html"><![CDATA[How a recent paper proves Transformer language models are injective as functions from prompts to activations, and can be inverted to reconstruct inputs.]]></summary>
</entry>
<entry>
    <title>Reading notes: Kolmogorov-Arnold Networks</title>
    <link href="https://lozeve.com/posts/kolmogorov-arnold-networks.html" />
    <id>https://lozeve.com/posts/kolmogorov-arnold-networks.html</id>
    <published>2024-06-08T00:00:00Z</published>
    <updated>2024-06-08T00:00:00Z</updated>
    <summary type="html"><![CDATA[Reading notes on Kolmogorov-Arnold Networks, which replace MLP node weights with learnable spline activations on edges, grounded in a representation theorem.]]></summary>
</entry>
<entry>
    <title>Randomness and Uncertainty: from random noise to predictable oscillations via differential equations</title>
    <link href="https://lozeve.com/posts/randomness-and-uncertainty.html" />
    <id>https://lozeve.com/posts/randomness-and-uncertainty.html</id>
    <published>2023-10-20T00:00:00Z</published>
    <updated>2023-10-20T00:00:00Z</updated>
    <summary type="html"><![CDATA[Exploring how a differential equation can turn random noise into stable bistable oscillations, replicating Trefethen's experiment in Python with Diffrax.]]></summary>
</entry>
<entry>
    <title>High reliability organizations</title>
    <link href="https://lozeve.com/posts/high-reliability-organizations.html" />
    <id>https://lozeve.com/posts/high-reliability-organizations.html</id>
    <published>2022-06-03T00:00:00Z</published>
    <updated>2022-06-03T00:00:00Z</updated>
    <summary type="html"><![CDATA[Notes on high reliability organizations, the five traits that let nuclear plants and air traffic control manage risk, and their relevance to robust AI.]]></summary>
</entry>

</feed>
