Question

\( 2 / 6 \) Consider the Turing machine whose graph is depicted here: 1. Update the given graph as little as possible to obtain the graph of a Turing machine multiplication which takes two numbers \( n \) and \( m \) written as sequences of \( 1 s \) and returns the number \( n \) followed by the number \( m \) followed by their product. The numbers \( n, m \) and their product should be separated by the symbols of choice (avoid the blank symbol). \( [1] \) For example, if you choose \( \nabla \) and \( \nabla \) then input and output tapes may look as follows: \begin{tabular}{lllllllll} -1 & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 \\ \hline\( |\wedge| \) & \( 1 \mid \) & \( 1 \mid \) & \( 0 \mid \) & \( 1 \mid \) & \( 1 \mid \) & \( 1 \mid \) & \( \wedge \mid \) & \( \wedge \mid \) \\ \hline & \( \uparrow \) & & & & & & & \end{tabular} \begin{tabular}{ccccccccccccccc} -1 & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 & 11 & 12 & 13 \\ \hline\( |\wedge| \) & \( 1 \mid \) & \( 1 \mid \) & \( \nabla \mid \) & \( 1 \mid \) & \( 1 \mid \) & \( 1 \mid \) & \( 8 \mid \) & \( 1 \mid \) & \( 1 \mid \) & \( 1 \mid \) & \( 1 \mid \) & \( 1 \mid \) & \( 1 \mid \) & \( \wedge \mid \) \\ \hline & \( \uparrow \) & & & & & & & & & & & & & \\ \( q_{10} \) & & & & & & & & & & & & & \end{tabular}

          \( 2 / 6 \)
Consider the Turing machine whose graph is depicted here:
1. Update the given graph as little as possible to obtain the graph of a Turing machine multiplication which takes two numbers \( n \) and \( m \) written as sequences of \( 1 s \) and returns the number \( n \) followed by the number \( m \) followed by their product. The numbers \( n, m \) and their product should be separated by the symbols of choice (avoid the blank symbol).
\( [1] \) For example, if you choose \( \nabla \) and \( \nabla \) then input and output tapes may look as follows:
\begin{tabular}{lllllllll}
-1 & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 \\
\hline\( |\wedge| \) & \( 1 \mid \) & \( 1 \mid \) & \( 0 \mid \) & \( 1 \mid \) & \( 1 \mid \) & \( 1 \mid \) & \( \wedge \mid \) & \( \wedge \mid \) \\
\hline & \( \uparrow \) & & & & & & &
\end{tabular}
\begin{tabular}{ccccccccccccccc}
-1 & 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 & 11 & 12 & 13 \\
\hline\( |\wedge| \) & \( 1 \mid \) & \( 1 \mid \) & \( \nabla \mid \) & \( 1 \mid \) & \( 1 \mid \) & \( 1 \mid \) & \( 8 \mid \) & \( 1 \mid \) & \( 1 \mid \) & \( 1 \mid \) & \( 1 \mid \) & \( 1 \mid \) & \( 1 \mid \) & \( \wedge \mid \) \\
\hline & \( \uparrow \) & & & & & & & & & & & & & \\
\( q_{10} \) & & & & & & & & & & & & &
\end{tabular}

2 / 6
Consider the Turing machine whose graph is depicted here:
1. Update the given graph as little as possible to obtain the graph of a Turing machine multiplication which takes two numbers n and m written as sequences of 1 s and returns the number n followed by the number m followed by their product. The numbers n, m and their product should be separated by the symbols of choice (avoid the blank symbol).
[1] For example, if you choose ∇ and ∇ then input and output tapes may look as follows:

-1 0 1 2 3 4 5 6 7

|∧| 1 | 1 | 0 | 1 | 1 | 1 | ∧| ∧|

↑

-1 0 1 2 3 4 5 6 7 8 9 10 11 12 13

|∧| 1 | 1 | ∇| 1 | 1 | 1 | 8 | 1 | 1 | 1 | 1 | 1 | 1 | ∧|

↑

q10

Added by Jane C.

Question

Please give Ace some feedback