![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
Интересно, а существует ли аналог критерия полноты языка по Тьюрингу для естественных языков?
There's intresting - is there analogue of Turing's completeness criteria for natural languages?
There's intresting - is there analogue of Turing's completeness criteria for natural languages?
