Author

  • Amaresh Das

    • Southern University at New Orleans, New Orleans, LA, USA
    • United States

Abstract

Efficient market theory states that financial markets can process information instantly. Empirical observations have challenged the stricter form of the efficient market hypothesis (EMH). These empirical observations and theoretical considerations show that price changes are difficult to predict if one starts from the time series of price changes. This paper provides an explanation in terms of algorithmic complexity theory of Kolmogorov that makes a clearer connection between the efficient market hypothesis and the unpredictable character of stock returns.

Keywords

References

  • Basu, S., Pollack, R. & Roy, M. F. (2006). Algorithm in Real Algebraic Geometry (Algorithm and Computational Mathematics) Springer–Verlag, New York.
  • Beechey, M. Gruen, D. & Vickrey, J. (2000). The Efficient Market Hypothesis: A Survey. Reserve Bank of Australia.
  • Blum, M. (1967). On the Size of Machines. Information and Control , 11(3), 257-265.
  • Boltzmann, L. (1974). The Second Law of Thermodynamics. Popular Schriften, Essay 3, Address to a formal meeting of the Imperial Academy of Science, 29 May 1886, reprinted in Ludwig Boltzmann, Theoretical Physics and Philosophical Problem, S. G. Brush (Trans). Boston: Reidel. (Original work published 1886).
  • Burgisser, P., Clausen, M. & Shokrollahi, M. A. (1997). Algebraic Complexity Theory . Springer– Verlag, New York.
  • Cohn, H. & kumar, A. (2007). Universally Optimal Distribution Points in Spheres. Journal of American Mathematical Society, 20(1), 99-148.
  • Davidson, R. & Mackinnon, J. (1993). Estimation and Inference in Econometrics Oxford University Press.
  • Debnath, N. C. & Burgin, M., (2003). Software Metrics from the Algorithmic Perspective, Proceedings of the ISCA 18th International Conference Computers and their Applications, Honolulu, Hawaii, 279-282.
  • Fama, E. & French, K. (1992). The Cross-Section of Expected Stock Returns. Journal of Finance, 47(2), 427-465.
  • Kolmogorov, A. N. (1965). Three Approaches to the Quantitative Definition of Information, Problems of Information Transmission , 1(1), 1-7.
  • Malajovich, G. (2002). Lower Bounds for Some Decision Problems over C. Theoretical Computer Science , 276(1-2), 425-434.
  • Samuelson, P. A. (1965). Proof that Properly Anticipated Prices Fluctuate Randomly. Industrial Management Review , 6(2), 41-49.
  • Stout, W. F. (1974). Almost Sure Convergence, New York, Academic Press.
  • Tucker J. V. & Jucker, J. I. (2001). Computable Functions and Semi Computable Sets on ManySorted Algebras, Handbook of Logic in Computer Science, Logic and Algebraic Methods, Oxford University Press.
  • Ziegler, M. & Koolen, W. (2008). Kolmogorov Complexity Theory over the Real’s. Electronic Notes Theoretical Computer Science , 221, 153-169.

Downloads

No downloads have been recorded for this article yet. Figures appear here once readers begin downloading the full text.

How to Cite

Das, A. (2011). Martingales, Efficient Market Hypothesis and Kolmogorov’s Complexity Theory. Information Management and Business Review, 2(6), 252-258. https://doi.org/10.22610/imbr.v2i6.905

Share this article

Section

Research Paper

Published

2011-06-15

Submissions

Have research to publish? Information Management and Business Review welcomes submissions.

Make a Submission