Beard, Rodney (2001): A note on Rubinstein's ``Why are certain properties of binary relations relatively more common in natural language?". Unpublished.
This is the latest version of this item.
![[img]](http://mpra.ub.uni-muenchen.de/style/images/fileicons/application_pdf.png)
| PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 699Kb |
This note examines the complexity of complete transitive binary relations or tournaments using Kolmogorov complexity. The complexity of tournaments calculated using Kolmogorov complexity is then compared to minimally complex tournaments defined in terms of the minimal number of examples needed to describe the tournament. The latter concept is the concept of complexity employed by Rubinstein [6] in his economic theory of language. A proof of Rubinsein's conjecture on the complexity bound of natural language tournaments is provided.
| Item Type: | MPRA Paper |
|---|---|
| Language: | English |
| Keywords: | Economics of language, Binary relations, Tournaments |
| Subjects: | C - Mathematical and Quantitative Methods > C7 - Game Theory and Bargaining Theory > C79 - Other Z - Other Special Topics > Z0 - General > Z00 - General |
| ID Code: | 5795 |
| Deposited By: | Rodney Beard |
| Deposited On: | 17. Nov 2007 05:53 |
| Last Modified: | 17. Nov 2007 05:53 |
All papers reproduced by permission. Reproduction and distribution subject to the approval of the copyright owners.
Repository Staff Only: item control page
