Is grammar that old?
Apr. 20th, 2006 05:25 pm![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png)
http://en.wikipedia.org/wiki/Panini
"Panini was an ancient Indian grammarian (c. 520–460 BC, but estimates range from the 7th to 4th centuries BC) who lived in Gandhara and is most famous for his grammar of Sanskrit, particularly for his formulation of the 3,959 rules of Sanskrit morphology in the text Ashtadhyayi."
"Panini uses metarules, transformations, and recursions with such sophistication that his grammar has the computing power equivalent to a Turing machine."
"Panini was an ancient Indian grammarian (c. 520–460 BC, but estimates range from the 7th to 4th centuries BC) who lived in Gandhara and is most famous for his grammar of Sanskrit, particularly for his formulation of the 3,959 rules of Sanskrit morphology in the text Ashtadhyayi."
"Panini uses metarules, transformations, and recursions with such sophistication that his grammar has the computing power equivalent to a Turing machine."
no subject
Date: 2006-04-20 09:54 pm (UTC)"Panini-Backus form"! Cool!
no subject
Date: 2006-04-20 10:51 pm (UTC)no subject
Date: 2006-04-20 10:54 pm (UTC)no subject
Date: 2006-04-20 11:52 pm (UTC)no subject
Date: 2006-04-21 02:11 am (UTC)вот это несколько....туманно.
А как ты это понял?
no subject
Date: 2006-04-21 02:51 am (UTC)надо сказать, бывают поразительно простые переписывающие системы, с полной силой машин Тьюринга, например S, K are constant terms, if X, Y are terms, (X Y) is a term, (X Y Z) means ((X Y) Z), and transformations are (K x y) -> x; (S x y z) -> (x z (y z)) ..
так что я не знаю, так ли уж это важно..
no subject
Date: 2006-04-21 05:33 am (UTC)no subject
Date: 2006-04-21 06:10 am (UTC)