How Far Can We Go Through Social System?

Hokky Situngkir ()

Method and Hist of Econ Thought from University Library of Munich, Germany

Abstract: 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.

Keywords: meta-sociology; algorithmic information theory; incompleteness theorem; sociological theory; sociological methods (search for similar items in EconPapers)
JEL-codes: B (search for similar items in EconPapers)
Pages: 10 pages
Date: 2004-09-27
New Economics Papers: this item is included in nep-cbe, nep-cmp and nep-hpe
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.
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://econwpa.ub.uni-muenchen.de/econ-wp/mhet/papers/0409/0409002.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wpa:wuwpmh:0409002

Access Statistics for this paper

More papers in Method and Hist of Econ Thought from University Library of Munich, Germany
Bibliographic data for series maintained by EconWPA ( this e-mail address is bad, please contact ).