4 ms·> if a language is decidable it can't be Turing complete mentioned in a different comment in this thread!by elnygren 9y ago> if a language is decidable it can't be Turing complete mentioned in a different comment in this thread!