### Table 6. Statistics of TuringMachine.

2004

"... In PAGE 14: ...2.4 Statistics - control patterns (TuringMachine) Table6 shows the statistics for TuringMachine. TuringMachine has 32 kinds of control patterns, one with the highest numbers among our benchmark programs.... ..."

Cited by 1

### Table 13: Example: DEXP Turing Machine Tableau

2004

Cited by 29

### Table 2: All the costs concerning interaction.

1998

"... In PAGE 4: ... Such situations are related with the calculation complexity of constituent Turing machines. Table2 indi- cates the costs required for each interaction. For example, when Turing machine T8524 operates on the description tape for T1812, Turing machine T8524 makes use of 4 states within its 19 states, and it takes 15 steps to accept that tape.... ..."

Cited by 1

### Table 2: All the costs concerning interaction.

1998

"... In PAGE 4: ... Such situations are related with the calculation complexity of constituent Turing machines. Table2 indi- cates the costs required for each interaction. For example, when Turing machine T8524 operates on the description tape for T1812, Turing machine T8524 makes use of 4 states within its 19 states, and it takes 15 steps to accept that tape.... ..."

Cited by 1

### Table 2: All the costs concerning interaction.

1998

"... In PAGE 4: ... Such situations are related with the calculation complexity of constituent Turing machines. Table2 indi- cates the costs required for each interaction. For example, when Turing machine T8524 operates on the description tape for T1812, Turing machine T8524 makes use of 4 states within its 19 states, and it takes 15 steps to accept that tape.... ..."

Cited by 1

### Table 4. Success rates for the ten Turing machine problems

"... In PAGE 10: ...Using Genetic Programming for Turing Machine Induction 359 The success rates for the ten problems are listed in Table4 . The success rate is the percentage of the ten runs performed that produced a general solution.... ..."

### TABLE 1. Transition Tables of Some Interesting Turing Machines

1990

Cited by 9

### Table 2: CA-rule equivalent to Turing machine

### Table 5.4: Performance data for universal Turing machine

2007

"... In PAGE 75: ... The Towers of Hanoi program contains only two rules and no guard conditions. Table5... ..."