Theory of computation question . Classification: Computability (S22) Classify the following languages as below, and justify your answer: (RE) recursive enumerable (r.e.), (CO-RE) co-r.e. (i.e. the complement is r.e.),

Consider the following recursive definition to define a language L over the alphabet S={0,1}: Base Step: 1∈L Recursion Step: For each w in L, 0w0 is in L.   Each string in L can be derived from the base step together with a finite number of applications of the recursion step.   a) List two string in L. b) List two strings not in L. c) Write set notation to describe L.

Can you describe how the Structured Programming Theorem clarifies the GOTO ambiguity and convoluted code? Write an appropriate-length essay using only your own words.

(please type answer)