Question: computer science and you need to replace it with that many 1 ' s . They do not have to be at the beginning of

computer science
and you need to replace it with that many 1's. They do not have to be at the beginning of the tape. Examples: "12"-->"111111111111","07",-->"1111111","00"-->"._".
A Turing machine implementation for the conversion from decimal to unary would begin with a blank tape. The machine would begin in the leftmost cell and scan to the right untili it reaches a cell containing data. It would then read the value in that cell and write the appropriate number of 15 in the adjacent cells. Finally, it would return to the leftmost cell and repeat the process until the tape ran out.
For instance, if the input was "12," the machine would write "1" in the first cell before moving to the second. It would then write "1111" in the following four cells before returning to the initial cell. Then, it would put "1" in the first cell and go to the second. It would then write "1111" in the next four cells before returning to the first cell and repeating the process until the end of the tape is reached.
Similarly, if the input were "07", the machine would write "1" in the first cell before on to the second. It would then write "1111111" in the following seven cells before returning to the first cell. Then, it would put "1" in the first cell and go to the second. It would then write "1111111" in the next seven cells before returning to the first cell and repeating the process until the end of the tape was reached.
Lastly, given the input "00," the computer would perform no action because there are no non-blank cells.
2.) Give the state transition diagram (formal description) for the Turing machine in Problem 1.
Question marks]
A mass of consumers is uniformly distributed along the interval 0,1. Two firms, A and B, are located at points 0 and 1 respectively. We denote by pi the price of firm iinA,B. A consumer located at point xin[0,1] obtains utility UA(x)=u-pA-tx2 if he consumes from firm A, and substitute x for the last number of your student ID number.
(a) Find the demand function for both firms.
[5 marks]
(b) Assume firms set their prices simultaneously. Solve for the Nash equilibrium prices, and compute the equilibrium profits. [6 marks]
(c) Now, assume a Stackelberg timing, where firm A is the leader. Explain briefly why we should not use the Nash equilibrium concept to solve this game, and solve for the equilibrium prices and profits.
[8 marks]
(d) Compare the results obtained in parts (b) and (c) and explain the intuition for such difference. Are the equilibria efficient?
[5 marks]
(e) Suppose that there was a technology that allowed firm A to credibly commit not to change its price (this option to commit would make firm A the Stackelberg leader, as in part c). If only firm A had access to this technology, how much would firm A be willing to pay for it? only firm A had access to this technology, how much would firm A be willing to pay for it? How would your answer change if the technology was auctioned to the best bidder (between How would your answer change if the technology was auctioned to the best bidder (between firms A and B)?[4 marks]
Assume that firms A and B can perfectly discriminate between locations. That is, firm i chooses a price pi(x) for each location xin[0,1]. Firms now compete by simultaneously choosing the pricing functions p1() and ). There is no possibility of between firms A and B, they go to the closest firm.
(f) Find the Nash-equilibrium pricing functions. That is, you need to find the equilibrium prices of every firm in every location.
[8 marks]
Consider a consumer whose utility function and budget constraint are given by u(x,y)=x08y02 and p.x+pyy=I, respectively, where px is the price of good x,px is the price of good y, and I is the consumer's income.
a) Derive the ordinary derand functions, x**(px,py,l) and y**(px,py,I)
b) Derive the consumer's indirect utility function, u'(px,,py,I)
c) Calculate the partial derivatives, hat(del)u
 computer science and you need to replace it with that many

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!