Tristan Stérin

collaborators

2 papers

cs.LO2025

Determination of the fifth Busy Beaver value

The bbchallenge Collaboration, Justin Blanchard, Daniel Briggs +17

The Busy Beaver value $S (n)$ is the maximum number of steps that an $n$ -state 2-symbol Turing machine can perform from the all-zero tape before halting. $S$ was historically introd…

cs.DM2019

Binary expression of ancestors in the Collatz graph

Tristan Stérin

The Collatz graph is a directed graph with natural number nodes and where there is an edge from node $x$ to node $T (x) = T_{0} (x) = x /2$ if $x$ is even, or to node $T(x)=T_1(x)=\frac{3x+…