Register

UGC NET CSE | November 2017 | Part 3 | Question: 61

• edited by
331 views
1 votes
1 votes

Which of the following statements is not correct?

  1. Every recursive language is recursively enumerable
  2. $L=\{ 0^n \: 1^n \: 0^n \mid n=1,2,3, \dots \}$ is recursively enumerable
  3. Recursive languages are closed under intersection
  4. Recursive languages are not closed under intersection
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
3 answers
1
Arjun asked Nov 5, 2017
870 views
UGC NET CSE | November 2017 | Part 3 | Question: 74
Which of the following routing technique / techniques is/are used in distributed systems? Fixed Routing Virtual Routing Dynamic Routing (a) only (a) and (b) only (c) only All (a), (b), (c)
Which of the following routing technique / techniques is/are used in distributed systems?Fixed RoutingVirtual RoutingDynamic Routing(a) only(a) and (b) only(c) onlyAll (a...
User Avatar
1 votes
1 votes
2 answers
3
Arjun asked Nov 5, 2017
957 views
UGC NET CSE | November 2017 | Part 3 | Question: 72
The Sigmoid activation function $f(t)$ is defined as $\dfrac{1}{\text{exp} (t) + \text{exp} (-t)}$ $t \text{ exp}(-t)$ $\dfrac{1}{1+ \text{exp} (t)}$ $\dfrac{1}{1+ \text{exp} (-t)}$
The Sigmoid activation function $f(t)$ is defined as$\dfrac{1}{\text{exp} (t) + \text{exp} (-t)}$$t \text{ exp}(-t)$$\dfrac{1}{1+ \text{exp} (t)}$$\dfrac{1}{1+ \text{exp...
User Avatar
Link Copied!