User blog comment:LittlePeng9/ITTM galore/@comment-10429372-20140318165300/@comment-5529393-20140318184056

Did Hamkins, Lewis, or Welch give a definition of ITTM's for multiple symbols? If not, a natural definition would be that the symbol set will be some initial segment of the ordinals. At each limit step alpha, for each cell C, we take the limsup of the ordinals in cell C at each time less than alpha. According to those rules, Wythagoras' machines seem to work as advertised.

What about gamma(2,2)? Could there be a way of coverting regular Busy Beavers into ITTM Busy Beavers?