Turing’s World Ch8 Exercise 22

Exercise 22 (Successor) Show that the function f(k) = k+1 is Turing computable by building a machine to compute it. How few states can you get away with?
Note: the input tape used for this function will contain a string of adjacent *’s, where a tape of just one * represents the number zero and a tape of just two contiguous *’s represents the number one. Blank tape cells are denoted by “_”.
Current State Symbol Read Action Next State
0 * MOVE RIGHT 0
0 _ * 1
1 * MOVE LEFT 1
1 _ MOVE RIGHT 2
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s


%d bloggers like this: