|
|
|
|
|
|
by DougMerritt
1215 days ago
|
|
|
He knows the famous result that "Equivalence of two Turing Machines is undecidable", but hopes to find a subset for which it is decidable, which would allow various interesting algorithms. Unfortunately a decidable subset is not a Turing Machine ("unrestricted grammar" in the Chomsky hierarchy), which is possibly why the project went inactive. |
|
|