Question

Let f be the addition function that maps the representation of a pair of numbers x, y to the representation of the number x + y. Let g be the multiplication function that maps (x, y) to $x \cdot y$. Prove that both f and g are computable by writing down a full description (including the states, alphabet, and transition function) of the corresponding Turing machines.

          Let f be the addition function that maps the representation of a pair of numbers
x, y to the representation of the number x + y. Let g be the multiplication function
that maps (x, y) to $x \cdot y$. Prove that both f and g are computable by writing down
a full description (including the states, alphabet, and transition function) of the
corresponding Turing machines.

Let f be the addition function that maps the representation of a pair of numbers
x, y to the representation of the number x + y. Let g be the multiplication function
that maps (x, y) to x · y. Prove that both f and g are computable by writing down
a full description (including the states, alphabet, and transition function) of the
corresponding Turing machines.

Added by Anna B.

Discrete Mathematics and its Applications

Kenneth Rosen 8th Edition

Chapter 13

Instant Answer

Solved by Expert Amany Waheeb

Step 1

We'll start with the addition function $f$. ### Turing Machine for Addition Function $f$ #### Step 1: Define the Alphabet - The tape alphabet: $\Gamma = \{0, 1, B, +\}$ - $0, 1$ represent binary digits. - $B$ represents a blank space. - $+$ is Show more…

Show all steps

Thanks for your feedback!

Let f be the addition function that maps the representation of a pair of numbers x,y to the representation of the number x + y. Let g be the multiplication function that maps (x,y) to x :y.. Prove that both f and g are computable by writing down a full description (including the states, alphabet, and transition function) of the corresponding Turing machines