Re: Some one first said
Hmmmm.... This is a horrible abuse of notatation and probably would get me lambasted back in my old department, but its in service of amusement.
Let D(i,g,m) be a universal computer that is in steady-state 0. D(i,g,m) shifts/halts on output 1 if machine i halts on code g under input m. We will call this Machine Digm for short.
Let D' be a universal computer on D that halts (shifts to state 1) iff D shifts.
So, by reduction to the halting problem, Some pair of Digms will never shift.
Davin
