Bourbaki Notes now has per-post discussions with local accounts, proof-of-work abuse control, and a small admin interface.
Articles on mathematics, physics, and computer science.
Bourbaki Notes
Recent Notes
A local Ollama benchmark checks whether language models can identify the shrinking state variable in a recursive integer-square-root complexity analysis.
Part four extends LifetimeCheck through store and load operations, structured control flow, scope cleanup, coroutine tasks, return safety, and implementation patterns.
Part two follows the LifetimeCheck pass architecture, its type categories, points-to sets, allocation classification, and operation dispatch.
Part one introduces ClangIR as an MLIR-based representation for C++ static analysis and uses LifetimeCheck to motivate the series.
Part three shows how ClangIR AST attributes, move detection, smart pointer handling, and moved-from state tracking detect use-after-move bugs.
Objects, morphisms, composition, identity morphisms, categories, and the category of sets provide the base language for the series.
The Curry-Howard-Lambek correspondence relates propositions, proofs, programs, and categorical structure.
Limits and colimits express universal constructions through cones, cocones, terminal objects, products, sums, and equalizers.
Monads arise from monoids in the category of endofunctors and model structured computation in programming languages.
Universal constructions describe initial and terminal objects, products, sums, monoids, exponential objects, and type algebra.
Notes on strict weak ordering and why violating std::sort comparator requirements can corrupt results.
The series introduces category theory as a connected collection of definitions, examples, and applications in sets, programming languages, and physics.
Groups, rings, fields, and vector spaces provide algebraic background used by the categorical examples.
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.
Topos theory studies categories that behave like generalized universes of sets.
Yoneda's lemma explains how an object of a locally small category is determined by the morphisms into or out of it.
Natural transformations compare functors component by component and organize functors into their own categories.
Functors map objects and morphisms between categories while preserving composition and identity.
Kleisli categories describe composition for computations with effects such as partiality, exceptions, and nondeterminism.
Part three of a three-post series on Shor's algorithm and its cryptographic applications, focused on elliptic curves and ECDH.
Part two of a three-post series on Shor's algorithm and its cryptographic applications, focused on the quantum Fourier transform and discrete logarithms.
A derivation of Grover's algorithm for unstructured search, including phase inversion, inversion about the mean, and square-root query complexity.
Part one of a three-post series on Shor's algorithm and its cryptographic applications, focused on period finding and RSA.
A derivation of the second-order coherence criterion for nonclassical light, explaining photon bunching, antibunching, sub-Poissonian statistics, and the Hanbury Brown-Twiss measurement.
A quantum cryptography protocol based on entangled photon pairs, using Bell-inequality tests to distribute a shared key and detect interception attempts.