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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Length: 10 pages Date of creation: 27 Sep 2004 Date of revision: Handle: RePEc:wpa:wuwpmh:0409002
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://129.3.20.41
For technical questions regarding this item, or to correct its listing, contact: (EconWPA).