English Release 23-October 2014
- Prime Minister's Office
- PM meets various groups of flood affected people in Srinagar, listens to their problems and suggestions
- PM's surprise visit to Siachen; celebrates Diwali with officers and jawans of the Indian Armed Forces
- PM greets the Nation on auspicious Occasion of Diwali
Ministry of Communications & Information Technology30-August, 2004 17:16 IST
|Postage stamp on Panini|
|The Department of Posts has released a postage stamp today in commemoration of India’s Heritage in Grammar and Mathematics which was influenced by the accomplishments of Panini, one of the greatest grammarians of all time whose work revolutionised the use of language not only in India but also in the rest of the world. The stamp is in the denomination of Rs. 5.
Panini, whose lifetime was believed to be between 520 BC and 460 BC, was born in Shalatula, a town near Taxilla on the Indus river in the present-day North-West Province in Pakistan. Though the dates given for Panini’s birth range from the seventh to fourth century BC, it is believed he was born about 520 BC.
Panini’s brilliant account of the structure of the Sanskrit language seeks to provide a complete, maximally concise and theoretically consistent analysis. It unfolds a theory of human language where the infinite language is generated by finite grammar which modern linguistic acknowledges as the complete, generative grammar of any language yet written.
Panini gives formal production rules and definitions to describe Sanskrit grammar. There are four major components of his grammar (I) Astadhyayi or Astaka (ii) Sivasutras, (iii) Dhatupatha and (iv) Ganapatha. Today, Panini’s grammar has been compared to Euclid’s geometry and his constructions can be seen as comparable to modern definitions of a mathematical function. Panini’s rules are said to be perfect-that is, they perfectly describe the Sanskrit morphology, and are regarded as so clear that computer scientists have made use of them to teach computers to understand Sanskrit. Panini uses metarules, transformations and recursion in such sophistication that his grammar has the computing power equivalent to a Turing machine. In this sense Panini may be considered the father of computing machines.
(Release ID :3583)