|
|
|
|
|
by aleeds
3367 days ago
|
|
From what I understand, the idea is you have some string S and an input T, and running a grammar G on ST will produce an output. Sometimes they won't halt. Just like a Turing machine. In this analogy G is the 'universal Turing machine' |
|