COMP 4141

Harvard University

COMP

### Question Description

I’m stuck on a Mathematics question and need an explanation.

Will share study notes once it's assigned..........................................

### Unformatted Attachment Preview

Purchase answer to see full attachment

## Final Answer

I'm still working on question 1

Q2

Recursively enumerable

A turning machine M, on an input 𝑠 either accept or reject thus halt or loop.

Denoting the language of a turing machine as 𝐿(𝑀), the set of all strings 𝑤 is what Turing

machine M accepts

If there is a Turing machine M that accepts a language L that is recursively enumerable will be

𝐿(𝑀) = 𝐿

When, 𝐿𝑑 = {𝑀 | 𝑀 ∉ 𝐿(𝑀)

Inputs strings over {0,1}

The respresentation are in 𝑖th binary string in the order (1,2,3, … … . 𝑖)

The turning machine accepts corresponding to 𝑖th a...