Show that a set is recognized by a Turing machine if and
Chapter 12, Problem 12.14(choose chapter or problem)
Show that a set is recognized by a Turing machine if and only if it is generated by a phrase-structure grammar.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer