User blog comment:LittlePeng9/Color reducing for Turing machines/@comment-5529393-20130418174310

Do you know any way to reduce the number of states while increasing the number of colors? If we could reduce the number of states of any TM to two, that would settle a question Ikosarakt1 asked earlier about uncomputability of \(\Sigma(c, n)\).