- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- MS Excel
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP
- Physics
- Chemistry
- Biology
- Mathematics
- English
- Economics
- Psychology
- Social Studies
- Fashion Studies
- Legal Studies

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# Show that the set of all languages that are not recursively enumerable on {a} is not countable?

A Recursively enumerable language is the language that accepts every string otherwise not. If a language that halt on every string, then we call it as recursive language.

### Problem

We need to prove that the set of all languages that are not recursively enumerable on {a} is not countable.

First let see what the recursive enumerable language is −

**Recursive Enumerable Language**

A language L is recursively enumerable if L is the set of strings accepted by some TM.

If L is a recursive enumerable language then −

if w ∈ L then a TM halts in a final state,

if w ∉ L then a TM halts in a non-final state or loops forever.

If L is a recursive language then −

if w ∈ L then a TM halts in a final state,

if w ∉ L then TM halts in a non-final state.

**Now, by understanding the definition of recursively enumerable language, prove that the set of all languages that are not recursively enumerable on {a} is not countable.**

**Proof**

**Step 1** − Let us assume S be the set of all the languages over an alphabet ∑.

**Step 2** − Let us assume that the set S of all languages is uncountable.

**Step 3** − The set S is the union of two sets S1 and S2, such that, set S1 consists form all the recursively enumerable languages (those languages that are accepted by Turing Machines), and, set S2 consists from all the non recursively enumerable languages (note that S1' = S2).

**Step 4** − Now, we have to prove that S2 is uncountable. As we have S = S1∪S2. And we know that the set S1 is countable, since the set of Turing Machines is countable.

**Step 5** − If S2 was countable then we can say that set S is also countable (as the union of two countable sets is countable). But this cannot be possible, since set S is uncountable. Therefore, we can say that set S2 is uncountable.

- Related Articles
- Show that the set of recursive languages is closed under reversal?
- Prove that the Cartesian product of a finite number of countable sets is countable?
- Show that of all line segments drawn from a given point not on it, the perpendicular line segment is the shortest.
- Show that $2+\sqrt{2}$ is not rational.
- What is a recursive and recursively enumerable language?
- How to set what browsers will show that do not support the ruby element?
- State two observations which show that atom is not indivisible.
- Show that the sequence defined by $a_n = 3n^2 – 5$ is not an A.P.
- Create a column on my table that allows null but is set by default to empty (not null)?
- Give the examples of a context free language that are not regular?
- Show that the following numbers are not perfect squares:(i) 9327(ii) 4058(iii) 22453(iv) 743522.
- Count of sub-strings that do not contain all the characters from the set {‘a’, ‘b’, ‘c’} at the same time in C++
- Two dice are thrown simultaneously. What is the probability that 5 will not come up on either of them?
- Are the square roots of all positive integers irrational? If not, give an example of the square root of a number that is a rational number.
- Detect area of a PNG that is not transparent with HTML