Scribd
Upload
363 views1 page

Q Q R Q Q R Q Q Q: 6 Construct A TM For Successor Function For A Given Unary Number - Ie. F (N) n+1

The document describes constructing Turing machines to perform successor functions on unary numbers. It provides the transition functions for a TM that takes a unary number n as input and outputs n+1. It then asks to construct a TM that takes a unary number n as input and outputs n+3, explaining it should move to the end of the input and change the last 3 blanks to 111. It also defines a universal Turing machine as one that can be programmed to solve any problem that can be solved by any Turing machine.

Uploaded by

Ram Anand
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
363 views1 page

Q Q R Q Q R Q Q Q: 6 Construct A TM For Successor Function For A Given Unary Number - Ie. F (N) n+1

The document describes constructing Turing machines to perform successor functions on unary numbers. It provides the transition functions for a TM that takes a unary number n as input and outputs n+1. It then asks to construct a TM that takes a unary number n as input and outputs n+3, explaining it should move to the end of the input and change the last 3 blanks to 111. It also defines a universal Turing machine as one that can be programmed to solve any problem that can be solved by any Turing machine.

Uploaded by

Ram Anand
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

6

Construct a TM for successor function for a given unary number.ie. f(n)=n+1.

Ans: Logic: Move to rightmost end of the input string and change blank to 1. The
corresponding

transitions are:

(q0 ,1) ( q0 ,1, R)


(q0 , ) ( q1 ,1, R)
( q1 , ) ( qa , , )

qa
where

is the final state.

Construct a TM for the function f(n)=n+3 where n is a unary number.

Ans: Logic: Move to rightmost end of the input string and change last 3 blanks to
111.

universal Turing machine (UTM) is a Turing machine that can be


A
programmed to solve any problem, that can be solved by any Turing machine.

You might also like