Re:PhD student solves 2,500-year-old Sanskrit problem
by svat on Friday December 16, 2022 @11:54PM
(#34024855)
Where does he say that? What I could find was these two bits:
> modern programmers would immediately compare the workings of Pāṇini’s rules to those of string functions in modern programming languages
(this is not about Sanskrit as a language, but specifically about Pāṇini's rules which is analogous to a term-rewriting system / string functions / macros)
and
> to claim that Sanskrit would be a perfect language for computer programming.[46] This claim demonstrates an essential misunderstanding of what programming languages
> modern programmers would immediately compare the workings of Pāṇini’s rules to those of string functions in modern programming languages
(this is not about Sanskrit as a language, but specifically about Pāṇini's rules which is analogous to a term-rewriting system / string functions / macros)
and
> to claim that Sanskrit would be a perfect language for computer programming.[46] This claim demonstrates an essential misunderstanding of what programming languages
which goes against what you're saying.