4 citations · 12 across the 9 of their papers we have counts for
10 papers
Generalized Fibonacci gates are Frobenius algebras: a proof of Liu's conjecture
Aaron Sterling
Liu introduced generalized Fibonacci gates on domains of size 3 and 4, proved that Holant problems built from them are tractable by a cut-and-merge algorithm, and conjectured that…
Provably Auditable and Safe LLM Agents from Human-Authored Ontologies
Aaron Sterling
We introduce the LLM agent architecture Agentic Redux, intended for use with nontrivial problem domains that require linear auditability. Using the typed lambda calculus, we prove…
Ontology of Card Sleights
Aaron Sterling
We present a machine-readable movement writing for sleight-of-hand moves with cards -- a "Labanotation of card magic." This scheme of movement writing contains 440 categories of mo…
Formal Verification of Self-Assembling Systems
Aaron Sterling
This paper introduces the theory and practice of formal verification of self-assembling systems. We interpret a well-studied abstraction of nanomolecular self assembly, the Abstrac…
Memory Consistency Conditions for Self-Assembly Programming
Aaron Sterling
Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal ass…
Self-Assembling Systems are Distributed Systems
Aaron Sterling
In 2004, Klavins et al. introduced the use of graph grammars to describe -- and to program -- systems of self-assembly. We show that these graph grammars can be embedded in a graph…