theory of computation
Please can some one help me with this:
Required proof:
A function is computable iff markov chain is recursive.
Any links which provide this proof is also welcome
Required proof:
A function is computable iff markov chain is recursive.
Any links which provide this proof is also welcome
Replies
-
Kaustubh KatdareTry this link: A function is computable iff markov chain is recursive - Google Search - Google search results for the proof. Does that help? -
phani987Thank you and One more Question
proof required:
If a language L is deterministically context free language then L is not inherently ambiguous
You are reading an archived discussion.
Related Posts
An Article in the Times of India says:
The ongoing International Congress of Mathematicians (ICM) in the city may have created an atmosphere for highbrow mathematical discussions, but the country's...
hi ppl, I am new here ( i just joined) lol 😛... Basically, i want to study electric/electronic engineering.. so, i want to know since most engineers are guys, will...
hey everyone, i'm super new in here and i would like to know more about engineering.... 😎
how do you edit your signature?? help... i searched just about everywhere.... 😡
is it possible to make a beam mechanically unconditionally balanced? It is very easy to do so by the use of magnets (1st pic), but is it possible to make...