New updates

Searching for :BotanyDate:2019-03-19 18:00:09Done by:Anonymous user(Visitor)Searching for :protein deficiency diseases is known asDate:2019-03-19 17:46:40Done by:Anonymous user(Visitor)

Searching for :difference between western & eastern ghatsDate:2019-03-19 17:45:55Done by:Anonymous user(Visitor)

Never Miss an Update

## 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.Asked by:satyashiromani

Taged users:

Msshikhilsatyashiromanipankajvaishnavi-DeshpandeUmangiamknownharshshah822ThreeRedbatsam22Oshal-BorkardeepuckrajManisha12Syedazaibunissaazher-khanpallaviaithalnAmoghleobeboMukil-lovanshi-tarun10113priyaOsho-meditation-center-banglore-nisargaOSHO-bookssameekshyathegdxrathinlz04milanyoyoyogmailcommilan-ransinghJessika-K

Likes:

deepuckraj

Dislikes:

Be first to dislike this question

## Comments

## Type your comment here