See Our team

Wondering how we keep quality?

Got unsolved questions?

Ask Questions

Engineering
GATE
CBSE
NCERT
Psychology
English
Computer
Constitution
Astrology
Yoga
Economics
Physics
Biology
Electronics
Microprocessor
Career
Interview
Anatomy
Botany

### New updates

Searching for :100unit=Date:2018-11-19 19:20:20Done by:Anonymous user(Visitor)Searching for :100unit=Date:2018-11-19 19:19:47Done by:Anonymous user(Visitor)

Searching for :Rock as fundamental unitsDate:2018-11-19 19:17:26Done by:Anonymous user(Visitor)

### Similar Questions

**Which of the following statements is/are TRUE for undirected graphs? -gate-computer science-2013**

1 Answer

**Which of the following statements are TRUE? -gate-computer science-2013**

1 Answer

**Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive any distinct. Consider the following statements: -gate computer science 2017**

1 Answer

**Consider the following two statements: -computer science-gate-2007**

1 Answer

**Which of the following graphs has an Eulerian circuit? -computer science-gate-2007**

1 Answer

**Consider the following statements: (-Gate Computer Science 2014)**

1 Answer

**Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? P: Minimum spanning tree of G does not change Q: Shortest pat**

1 Answer

**Q.63) Recall that Belady’s anomaly is that the pages-fault rate may increase as the number of allocated frames increases. Now consider the following statements: -gate computer science 2017**

1 Answer

**Let p, q, and r be the propositions and the expression (p -> q) -> r be a contradiction. Then, the expression (r -> p)-> q is : -gate computer science 2017**

1 Answer

**Let G be an undirected graph. Consider a depth-first traversal of G, and let T be the resulting depth-first search tree GATE CSE 2000**

1 Answer

**This question has statement I and Statement II. Of the four choice given after the statements, choose the one that best describes the two statements. - physics 2013**

1 Answer

**The statement (¬ p) → (¬ q) is logically equivalent to which of the statements below? I. p → q II. q → p III. (¬ q) ∨ p IV. (¬ p) ∨ q -gate computer science 2017**

1 Answer

**Q.62) Let A and B be infinite alphabets and let # be a symbol outside both A and B. Let f be a total functional from A* to B* .We say f is computable if there exists a Turning machine M which given an input x in A*, always halts with f(x) on its tape. Let Lf denotes the language {x#f(x)|x∈A*}. Which of the following statements is true? -gate computer science 2017**

1 Answer

**Which of the following statements are TRUE about an SQL query? -gate-computer science-2012**

1 Answer

**Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to -gate-computer science-2012**

1 Answer

**Consider the following statements for air-entrained concrete: (i) Air-entrainment reduces the water demand for a given level of workability (ii) Use of air-entrained concrete is required in environments where cyclic freezing and thawing is expected Which of the following is TRUE? - gate civil 2017**

1 Answer

**Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is ½. What is the expected number of unordered cycles of length three? -gate-computer science-2012**

1 Answer

**Let G be a simple undirected planar graph on 10 vertices with 15edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to -gate-computer science-2012**

1 Answer

**For a vector E, which one of the following statements is NOT TRUE? GATE-Instrumentational-Engineering-2013**

1 Answer

**In an unweighted, undirected connected graph, the shortest path from a node S to every other node is computed most efficiently, in terms of time complexity, by -computer science-gate-2007**

1 Answer

### Notes

**GATE Computer Science Engineering / Information Technology Question Paper 2013 download**

**GATE Computer Science Engineering / Information Technology Question Paper with Answer key 2004 download**

**GATE Computer Science Engineering / Information Technology Question Paper 2012 download**

**GATE Computer Science Engineering / Information Technology Question Paper with Answer key 2011 download**

**CE - Civil Engineering**

**GATE Computer Science Engineering / Information Technology Question Paper with Answer key 2003 download**

**GATE Computer Science Engineering / Information Technology Question Paper with Answer key 2006 download**

**GATE Computer Science Engineering / Information Technology Question Paper with Answer key 2005 download**

**GATE Electronics and Communication Engineering Question Paper 2013 download**

**GATE Computer Science Engineering / Information Technology Question Paper with Answer key 2007 download**

## Q.62) Let A and B be infinite alphabets and let # be a symbol outside both A and B. Let f be a total functional from A* to B* .We say f is computable if there exists a Turning machine M which given an input x in A*, always halts with f(x) on its tape. Let Lf denotes the language {x#f(x)|x∈A*}. Which of the following statements is true? -gate computer science 2017

A) f if computable if and only if Lf is recursive.B) f if computable if and only if Lf is recursive enumerable.C) if f is computable then Lf is recursive, but not conversely.D) if f is computable then Lf is recursively enumerable, but not conversely.By:satyashiromani

Taged users:

|Msshikhil|satyashiromani|pankaj|vaishnavi-Deshpande|Umang|iamknown|harshshah822|ThreeRed|batsam22|Oshal-Borkar|deepuckraj||Manisha12|Syedazaibunissa|azher-khan|pallaviaithaln|Amogh|leo|bebo|Mukil-lovanshi-|tarun101|13priya|Osho-meditation-center-banglore-nisarga|OSHO-books|sameekshya|thegdx|rathinlz04|milanyoyoyogmailcom|milan-ransingh|Jessika-K

Likes:

|deepuckraj

Dislikes:

Be first to dislike this question

Talk about thisDelete|Like|Dislike|

## Answers

A) f if computable if and only if Lf is recursive.deepuckraj

Likes:

Be first to like this answer

Dislikes:

Be first to dislike this answer

Talk about this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|

------------------------------------

## Can you help us to add better answer here? Please see this