New answers tagged

3 votes

Cellular automata on the Eisenstein integers?

Yes, such cellular automata have been studied. However, you're unlikely to find much about them using terms like "Eisenstein integers", since the convention in the field is to describe ...
user avatar
1 vote

Is there a TM that halts on all inputs but that property is not provable?

The halting of one TM can be encoded by constructing another TM and asking whether it halts. That is, given TM $T_1$ and input $I_0$, we can construct a TM $T_2$ with inputs indexed by the natural ...
user avatar

Top 50 recent answers are included