Past exam of the mathematics course of the University of Cambridge / 2025 / ii / Paper 1 / 12F / a / iii

Table of contents
- Solution iii

Solution

Fix an effective coding of machines and write

W_{w}

for the computably enumerable language recognized by code

w

I

of codes is an index set when membership depends only on the recognized language:

W_{u} = W_{v} ⟹ (u \in I ⟺ v \in I) .

It is nontrivial when it is neither empty nor all of

B

.

 Ancestors (11)

 View article source

 Discussion (0)

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic Create my own version