2 citations · 9 across the 7 of their papers we have counts for
1 paper · 1 filter
Matthew Moore
For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only if T halts, thus proving that t…