2 ms·Turing completeness and undecidable parsing grammars are completely orthogonal concepts.by banachtarski 6y agoTuring completeness and undecidable parsing grammars are completely orthogonal concepts.