How Far Can We Go Through Social System?
The paper elaborates an endeavor on applying the algorithmic information-theoretic computational complexity to meta-social-sciences. It is motivated by the effort on seeking the impact of the well-known incompleteness theorem to the scientific methodology approaching social phenomena. The paper uses the binary string as the model of social phenomena to gain understanding on some problems faced in the philosophy of social sciences or some traps in sociological theories. The paper ends on showing the great opportunity in recent social researches and some boundaries that limit them.
|Date of creation:||27 Sep 2004|
|Date of revision:|
|Note:||Type of Document - pdf; pages: 10. The paper is an effort on applying the Gregory Chaitin's algorithmic information-theoretic computational complexity to meta-social-sciences.|
|Contact details of provider:|| Web page: http://econwpa.repec.org|
When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpmh:0409002. 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: (EconWPA)
If references are entirely missing, you can add them using this form.