Why would you assume this is off-topic? The article is not only about "Turing machine busy beaver programs" but also aims to define "spaghetti code" in a more g

Why would you assume this is off-topic? The article is not only about "Turing machine busy beaver programs" but also aims to define "spaghetti code" in a more general sense. In the first paragraph the author says "What’s needed is a formal theory of spaghetti code: an effective procedure that will determine of a given Turing machine program whether (or to what extent) the program is spaghetti". Note the statement 'given Turing machine program'. It doesn't seem to be scoped to only busy beaver programs. Also note the author's different usages of 'spaghetti code' and the 'Spaghetti Code Conjecture' indicating the discussion of each being different topics. This is further noted by the fact that the author brings the conversation back to the 'Spaghetti Code Conjecture' by writing "With all this in mind, we can restate the Spaghetti Code Conjecture formally: the control flow graph of (sufficiently long) Busy Beaver programs ought to be at least partially irreducible." With all that said, it seems the original commentator in this thread was discussing the definition of spaghetti code ("In particular, a graph that cannot be reduced at all can be considered utter spaghetti and a graph that can be eliminated completely can be considered thoroughly well-structured.") in relation to the states of a program. Building on the fact spaghetti code can (and has) been observed by the original commentator, they related the discussion of states to the development practice of using multiple flags (which leads to various states in a program)