A119683
Maximal number of steps that an n-state Turing machine can make which was started on an initially blank tape before halting on the blank tape again.
offset: 1
codomain: ℕ
The OEIS sequence has the tags “hard” and/or “more” and few known values. It is likely that the Lean code is not representing the actual sequence, even though it coincides in the known values.
Declarations
Section titled “Declarations”- A119683computable