People keep asking because they are looking for a rigorous example in a citation that's unambiguous. If it's not obvious, that is even more compelling.

I personally think the more theory trained folks wonder if there will turn out to be some analogy with the corresponding towers of languages and machines recognizing them (regular languages, finite automata, push down automata, turing machines, for examples).

https://a.co/d/8ix6V6m

is an example covering the historical language classes and recognizers for them.

Perhaps LLMs and various architectures will turn out fitting what you describe.

Yeah, I asked it that partly because I got curious if it could handle a task that well (because I know plenty of people who can't...), and partly because so many people keep rejecting other reasoning tasks.