Noncomputability, unpredictability, and financial markets

Complexity 17 (6):24-30 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/cplx.21395

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Noncomputability, unpredictability, undecidability, and unsolvability in economic and finance theories.Ying-Fang Kao, V. Ragupathy, K. Vela Velupillai & Stefano Zambelli - 2013 - Complexity 18 (1):51-55.
Computability-theoretic complexity of countable structures.Valentina S. Harizanov - 2002 - Bulletin of Symbolic Logic 8 (4):457-477.
Computability and the game of cops and robbers on graphs.Rachel D. Stahl - 2022 - Archive for Mathematical Logic 61 (3):373-397.
Compositionality, Computability, and Complexity.Peter Pagin - 2021 - Review of Symbolic Logic 14 (3):551-591.
Just Financial Markets?: Finance in a Just Society.Lisa Herzog (ed.) - 2017 - Oxford University Press.
Computability of solutions of operator equations.Volker Bosserhoff - 2007 - Mathematical Logic Quarterly 53 (4):326-344.
Ethics in finance.John Raymond Boatright (ed.) - 1999 - Malden, MA: Blackwell.
Computability and continuity in computable metric partial algebras equipped with computability structures.Fredrik Dahlgren - 2004 - Mathematical Logic Quarterly 50 (4):486.
Type-2 computability on spaces of integrables functions.Daren Kunkle - 2004 - Mathematical Logic Quarterly 50 (4):417.
Computability Theory.Valentina Harizanov, Keshav Srinivasan & Dario Verta - 2024 - In Bharath Sriraman (ed.), Handbook of the History and Philosophy of Mathematical Practice. Cham: Springer. pp. 1933-1961.

Analytics

Added to PP
2013-11-03

Downloads
69 (#242,601)

6 months
6 (#588,512)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Classical recursion theory: the theory of functions and sets of natural numbers.Piergiorgio Odifreddi - 1989 - New York, N.Y., USA: Sole distributors for the USA and Canada, Elsevier Science Pub. Co..

Add more references