A note on Rubinstein's ``Why are certain properties of binary relations relatively more common in natural language?"
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  in his economic theory of language. A proof of Rubinsein's conjecture on the complexity bound of natural language tournaments is provided.
|Date of creation:||2001|
|Date of revision:||16 Nov 2007|
|Contact details of provider:|| Postal: Ludwigstraße 33, D-80539 Munich, Germany|
Web page: https://mpra.ub.uni-muenchen.de
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Rubinstein, Ariel, 1996. "Why Are Certain Properties of Binary Relations Relatively More Common in Natural Language?," Econometrica, Econometric Society, vol. 64(2), pages 343-355, March.
When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:5795. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joachim Winter)
If references are entirely missing, you can add them using this form.