Finite “TM” programs and computational complexity
Suppose one is allowed denumerably many letters in an alphabet and denumerably many instructions (i.e., denumerably many four-tuples of the “Q1 0 1 Q2” (quintuples would do as well) in a TM program. Then one can treat each of the standard numerals in decimal notation as a letter in …