<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0">
  <channel>
    <title>Bourbaki Notes</title>
    <link>https://bourbaki.co.uk</link>
    <description>Articles on mathematics, physics, and computer science.</description>
    <language>en</language>
        <item>
      <title>Can Local LLMs Analyze Algorithmic Complexity?</title>
      <link>https://bourbaki.co.uk/posts/computer-science-ai-local-llm-complexity-benchmark/</link>
      <guid>https://bourbaki.co.uk/posts/computer-science-ai-local-llm-complexity-benchmark/</guid>
      <pubDate>Thu, 21 May 2026 12:00:00 +0000</pubDate>
      <description>A local Ollama benchmark checks whether language models can identify the shrinking state variable in a recursive integer-square-root complexity analysis.</description>
    </item>
    <item>
      <title>Control Flow, Scope, and Advanced Lifetime Cases</title>
      <link>https://bourbaki.co.uk/posts/computer-science-compilers-cir-control-flow-lifetime/</link>
      <guid>https://bourbaki.co.uk/posts/computer-science-compilers-cir-control-flow-lifetime/</guid>
      <pubDate>Wed, 11 Feb 2026 12:00:00 +0000</pubDate>
      <description>Part four extends LifetimeCheck through store and load operations, structured control flow, scope cleanup, coroutine tasks, return safety, and implementation patterns.</description>
    </item>
    <item>
      <title>Building the LifetimeCheck Pass</title>
      <link>https://bourbaki.co.uk/posts/computer-science-compilers-cir-lifetimecheck-pass/</link>
      <guid>https://bourbaki.co.uk/posts/computer-science-compilers-cir-lifetimecheck-pass/</guid>
      <pubDate>Wed, 11 Feb 2026 12:00:00 +0000</pubDate>
      <description>Part two follows the LifetimeCheck pass architecture, its type categories, points-to sets, allocation classification, and operation dispatch.</description>
    </item>
    <item>
      <title>Static Analysis with ClangIR</title>
      <link>https://bourbaki.co.uk/posts/computer-science-compilers-cir-static-analysis/</link>
      <guid>https://bourbaki.co.uk/posts/computer-science-compilers-cir-static-analysis/</guid>
      <pubDate>Wed, 11 Feb 2026 12:00:00 +0000</pubDate>
      <description>Part one introduces ClangIR as an MLIR-based representation for C++ static analysis and uses LifetimeCheck to motivate the series.</description>
    </item>
    <item>
      <title>AST Semantics and Use-After-Move Detection</title>
      <link>https://bourbaki.co.uk/posts/computer-science-compilers-cir-use-after-move/</link>
      <guid>https://bourbaki.co.uk/posts/computer-science-compilers-cir-use-after-move/</guid>
      <pubDate>Wed, 11 Feb 2026 12:00:00 +0000</pubDate>
      <description>Part three shows how ClangIR AST attributes, move detection, smart pointer handling, and moved-from state tracking detect use-after-move bugs.</description>
    </item>
    <item>
      <title>Base Definitions (Category Theory by Example)</title>
      <link>https://bourbaki.co.uk/posts/math-cattheory-base-definitions/</link>
      <guid>https://bourbaki.co.uk/posts/math-cattheory-base-definitions/</guid>
      <pubDate>Fri, 03 Sep 2021 12:00:00 +0000</pubDate>
      <description>Objects, morphisms, composition, identity morphisms, categories, and the category of sets provide the base language for the series.</description>
    </item>
    <item>
      <title>Curry-Howard-Lambek Correspondence (Category Theory by Example)</title>
      <link>https://bourbaki.co.uk/posts/math-cattheory-curry-howard-lambek/</link>
      <guid>https://bourbaki.co.uk/posts/math-cattheory-curry-howard-lambek/</guid>
      <pubDate>Sun, 06 Sep 2020 12:00:00 +0000</pubDate>
      <description>The Curry-Howard-Lambek correspondence relates propositions, proofs, programs, and categorical structure.</description>
    </item>
    <item>
      <title>Limits (Category Theory by Example)</title>
      <link>https://bourbaki.co.uk/posts/math-cattheory-limits/</link>
      <guid>https://bourbaki.co.uk/posts/math-cattheory-limits/</guid>
      <pubDate>Mon, 03 Feb 2020 12:00:00 +0000</pubDate>
      <description>Limits and colimits express universal constructions through cones, cocones, terminal objects, products, sums, and equalizers.</description>
    </item>
    <item>
      <title>Monads (Category Theory by Example)</title>
      <link>https://bourbaki.co.uk/posts/math-cattheory-monads/</link>
      <guid>https://bourbaki.co.uk/posts/math-cattheory-monads/</guid>
      <pubDate>Thu, 26 Dec 2019 12:00:00 +0000</pubDate>
      <description>Monads arise from monoids in the category of endofunctors and model structured computation in programming languages.</description>
    </item>
    <item>
      <title>Objects and Morphisms (Category Theory by Example)</title>
      <link>https://bourbaki.co.uk/posts/math-cattheory-objects-and-morphisms/</link>
      <guid>https://bourbaki.co.uk/posts/math-cattheory-objects-and-morphisms/</guid>
      <pubDate>Wed, 25 Dec 2019 12:00:00 +0000</pubDate>
      <description>Universal constructions describe initial and terminal objects, products, sums, monoids, exponential objects, and type algebra.</description>
    </item>
    <item>
      <title>Inside STL Sort Algorithm</title>
      <link>https://bourbaki.co.uk/posts/computer-science-algorithms-cppsort/</link>
      <guid>https://bourbaki.co.uk/posts/computer-science-algorithms-cppsort/</guid>
      <pubDate>Mon, 23 Sep 2019 12:00:00 +0000</pubDate>
      <description>Notes on strict weak ordering and why violating std::sort comparator requirements can corrupt results.</description>
    </item>
    <item>
      <title>Introduction (Category Theory by Example)</title>
      <link>https://bourbaki.co.uk/posts/math-cattheory-introduction/</link>
      <guid>https://bourbaki.co.uk/posts/math-cattheory-introduction/</guid>
      <pubDate>Wed, 24 Apr 2019 12:00:00 +0000</pubDate>
      <description>The series introduces category theory as a connected collection of definitions, examples, and applications in sets, programming languages, and physics.</description>
    </item>
    <item>
      <title>Abstract Algebra (Category Theory by Example)</title>
      <link>https://bourbaki.co.uk/posts/math-cattheory-abstract-algebra/</link>
      <guid>https://bourbaki.co.uk/posts/math-cattheory-abstract-algebra/</guid>
      <pubDate>Wed, 24 Apr 2019 12:00:00 +0000</pubDate>
      <description>Groups, rings, fields, and vector spaces provide algebraic background used by the categorical examples.</description>
    </item>
    <item>
      <title>Quantum Teleportation and Pseudo-Telepathy Games</title>
      <link>https://bourbaki.co.uk/posts/physics-quantum-information-quantum-teleportation-games/</link>
      <guid>https://bourbaki.co.uk/posts/physics-quantum-information-quantum-teleportation-games/</guid>
      <pubDate>Sat, 23 Mar 2019 12:00:00 +0000</pubDate>
      <description>A quantum teleportation protocol based on entangled photon pairs and Bell-state measurement, followed by the Mermin-Peres pseudo-telepathy game as a second application of entanglement.</description>
    </item>
    <item>
      <title>Topos (Category Theory by Example)</title>
      <link>https://bourbaki.co.uk/posts/math-cattheory-topos/</link>
      <guid>https://bourbaki.co.uk/posts/math-cattheory-topos/</guid>
      <pubDate>Thu, 28 Feb 2019 12:00:00 +0000</pubDate>
      <description>Topos theory studies categories that behave like generalized universes of sets.</description>
    </item>
    <item>
      <title>Yoneda's Lemma (Category Theory by Example)</title>
      <link>https://bourbaki.co.uk/posts/math-cattheory-yoneda/</link>
      <guid>https://bourbaki.co.uk/posts/math-cattheory-yoneda/</guid>
      <pubDate>Mon, 18 Feb 2019 12:00:00 +0000</pubDate>
      <description>Yoneda's lemma explains how an object of a locally small category is determined by the morphisms into or out of it.</description>
    </item>
    <item>
      <title>Natural Transformations (Category Theory by Example)</title>
      <link>https://bourbaki.co.uk/posts/math-cattheory-natural-transformations/</link>
      <guid>https://bourbaki.co.uk/posts/math-cattheory-natural-transformations/</guid>
      <pubDate>Thu, 07 Feb 2019 12:00:00 +0000</pubDate>
      <description>Natural transformations compare functors component by component and organize functors into their own categories.</description>
    </item>
    <item>
      <title>Functors (Category Theory by Example)</title>
      <link>https://bourbaki.co.uk/posts/math-cattheory-functors/</link>
      <guid>https://bourbaki.co.uk/posts/math-cattheory-functors/</guid>
      <pubDate>Fri, 01 Feb 2019 12:00:00 +0000</pubDate>
      <description>Functors map objects and morphisms between categories while preserving composition and identity.</description>
    </item>
    <item>
      <title>Kleisli Category (Category Theory by Example)</title>
      <link>https://bourbaki.co.uk/posts/math-cattheory-kleisli-category/</link>
      <guid>https://bourbaki.co.uk/posts/math-cattheory-kleisli-category/</guid>
      <pubDate>Sun, 04 Nov 2018 12:00:00 +0000</pubDate>
      <description>Kleisli categories describe composition for computations with effects such as partiality, exceptions, and nondeterminism.</description>
    </item>
    <item>
      <title>Shor's Algorithm and Elliptic Curve Cryptography</title>
      <link>https://bourbaki.co.uk/posts/computer-science-quantum-algorithms-shor-cryptography-shor-elliptic-curves/</link>
      <guid>https://bourbaki.co.uk/posts/computer-science-quantum-algorithms-shor-cryptography-shor-elliptic-curves/</guid>
      <pubDate>Fri, 09 Feb 2018 12:00:00 +0000</pubDate>
      <description>Part three of a three-post series on Shor's algorithm and its cryptographic applications, focused on elliptic curves and ECDH.</description>
    </item>
    <item>
      <title>Quantum Fourier Transform and Discrete Logarithms</title>
      <link>https://bourbaki.co.uk/posts/computer-science-quantum-algorithms-shor-cryptography-quantum-fourier-discrete-logarithms/</link>
      <guid>https://bourbaki.co.uk/posts/computer-science-quantum-algorithms-shor-cryptography-quantum-fourier-discrete-logarithms/</guid>
      <pubDate>Wed, 20 Dec 2017 12:00:00 +0000</pubDate>
      <description>Part two of a three-post series on Shor's algorithm and its cryptographic applications, focused on the quantum Fourier transform and discrete logarithms.</description>
    </item>
    <item>
      <title>Grover Algorithm</title>
      <link>https://bourbaki.co.uk/posts/computer-science-quantum-algorithms-grover-algorithm/</link>
      <guid>https://bourbaki.co.uk/posts/computer-science-quantum-algorithms-grover-algorithm/</guid>
      <pubDate>Sat, 30 Nov 2013 12:00:00 +0000</pubDate>
      <description>A derivation of Grover's algorithm for unstructured search, including phase inversion, inversion about the mean, and square-root query complexity.</description>
    </item>
    <item>
      <title>Shor Algorithm</title>
      <link>https://bourbaki.co.uk/posts/computer-science-quantum-algorithms-shor-cryptography-shor-algorithm/</link>
      <guid>https://bourbaki.co.uk/posts/computer-science-quantum-algorithms-shor-cryptography-shor-algorithm/</guid>
      <pubDate>Sat, 30 Nov 2013 12:00:00 +0000</pubDate>
      <description>Part one of a three-post series on Shor's algorithm and its cryptographic applications, focused on period finding and RSA.</description>
    </item>
    <item>
      <title>Nonclassical Light and Photon Antibunching</title>
      <link>https://bourbaki.co.uk/posts/physics-quantum-information-nonclassical-light/</link>
      <guid>https://bourbaki.co.uk/posts/physics-quantum-information-nonclassical-light/</guid>
      <pubDate>Sat, 30 Nov 2013 12:00:00 +0000</pubDate>
      <description>A derivation of the second-order coherence criterion for nonclassical light, explaining photon bunching, antibunching, sub-Poissonian statistics, and the Hanbury Brown-Twiss measurement.</description>
    </item>
    <item>
      <title>Quantum Cryptography</title>
      <link>https://bourbaki.co.uk/posts/physics-quantum-information-quantum-cryptography-entanglement/</link>
      <guid>https://bourbaki.co.uk/posts/physics-quantum-information-quantum-cryptography-entanglement/</guid>
      <pubDate>Sat, 30 Nov 2013 12:00:00 +0000</pubDate>
      <description>A quantum cryptography protocol based on entangled photon pairs, using Bell-inequality tests to distribute a shared key and detect interception attempts.</description>
    </item>
  </channel>
</rss>
