viewquestions/12295/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

View question



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 questionDelete|Like|Dislike|

Comments


Type your comment here



Join eduladder!