2 citations · 2 across the 5 of their papers we have counts for
7 papers
Putnam 2025 Problems in Rocq using Opus 4.6 and Rocq-MCP
Guillaume Baudart, Marc Lelarge, Tristan Stérin +1
We report on an experiment in which Claude Opus~4.6, equipped with a suite of Model Context Protocol (MCP) tools for the Rocq proof assistant, autonomously proved 10 of 12 problems…
Turing machines deciders, part I
The bbchallenge Collaboration, Justin Blanchard, Konrad Deka +9
The Busy Beaver Challenge (or bbchallenge) aims at collaboratively solving the following conjecture: "" [Radó, 1962], [Marxen and Buntrock, 1990], [Aaronson,…
Hardness of busy beaver value BB(15)
Tristan Stérin, Damien Woods
The busy beaver value BB(n) is the maximum number of steps made by any n-state, 2-symbol deterministic halting Turing machine starting on blank tape. The busy beaver function $n \m…
Small tile sets that compute while solving mazes
Matthew Cook, Tristan Stérin, Damien Woods
We ask the question of how small a self-assembling set of tiles can be yet have interesting computational behaviour. We study this question in a model where supporting walls are pr…
The Collatz process embeds a base conversion algorithm
Tristan Stérin, Damien Woods
The Collatz process is defined on natural numbers by iterating the map when is even and when is odd. In an effort…
Limitations on counting in Boolean circuits and self-assembly
Tristan Stérin, Damien Woods
In self-assembly, a -counter is a tile set that grows a horizontal ruler from left to right, containing columns each of which encodes a distinct binary string. Counters have…
scadnano: A browser-based, scriptable tool for designing DNA nanostructures
David Doty, Benjamin L Lee, Tristan Stérin
We introduce (https://scadnano.org) (short for "scriptable cadnano"), a computational tool for designing synthetic DNA structures. Its design is based heavily o…