|
Panini's grammar (6th century BCE or earlier) provides 4,000 rules that describe the Sanskrit of his day completely. This grammar is acknowledged to be one of the greatest intellectual achievements of all time. The great variety of language mirrors, in many ways, the complexity of nature and, therefore, success in describing a language is as impressive as a complete theory of physics. It is remarkable that Panini set out to describe the entire grammar in terms of a finite number of rules. Scholars have shown that the grammar of Panini represents a universal grammatical and computing system. From this perspective it anticipates the logical framework of modern computers. One may speak of a Panini machine as a model for the most powerful computing system.
|
