This preview shows page 1. Sign up to view the full content.
Unformatted text preview: CS 220 Winter 2011, Assignment 3, Due: February 17 1. Show that the function f ( x,y ) = x * y cannot be computed by any L 1program. 2. Consider a programming language Q whose only nonI/O instructions are of the forms: x 0, x 1, x x + y , x x y (monus), do x ... end . Denote by Q i the set of all programs with doloop depth i . Show that a function is computable by a Gprogram with running time bounded by an elementary function if and only if it is computable by a Q 1program. 3. Show that for i 1, a function is computable by a Q iprogram if and only if it is computable by an L i +1program. 4. From the definition of partial recursive functions, show that every partial recursive function can be computed by a G program. 5. Consider a DFA (deterministic finite automaton) M operating on the upperright quadrant of the plane, filled with s, with the boundaries delimited by $s. M starts in its intital state on the $ in the cell at the origin (location (0 , 0)).0))....
View
Full
Document
This note was uploaded on 01/28/2012 for the course CS 220 taught by Professor Ibarra,o during the Winter '08 term at UCSB.
 Winter '08
 Ibarra,O

Click to edit the document details