Is there any universal algorithm converting grammar to Turing Machine?

125 Views Asked by At

Is there any algorithm converting grammar into Turing Machine? It seems that there has to be one( but equivalence of Turing Machine and c.e. language is not proved algorithmatically in both direction, $G\Rightarrow TM$ is just a proof about a simulation to generating words of the language), If there is, how about it's computational complexity?