Hooley dooley.
This post is about a "found-in-the-wild" small Turing machine (3-states, 4-symbols), that halts --- after an Ackermann function-level number of steps; using Knuth's up-arrow notation, more than
and in fact we know exactly how many!
For a very poor sense of scale, the practically insignificant by comparison
@highergeometer who are these madfolk!?