While reading the reviews for Stephen Wolfram\'s \"A New Kind of Science\" on Amazon, I came across the following statement:
Every computer science (CS) s
Well, a turing machine program is, in fact, a table (state x tape symbol), so the program would just enumerate all such possible tables. like that:
for(int symbol_count = 1; true; symbol_count++)
{
for(int state_count = 1; state_count <= symbol_count; state_count++)
{
gen_table(symbol_count, state_count);
}
}
where gen_table enumerates all the action tables of such size (for example, treating the table as a big number and states as digits). That's longer than two lines in C, probably, Wolfram used some other, more powerful language.