Academia.eduAcademia.edu

Outline

No Rationality Through Brute-Force

2018, Unisinos Journal of Philosophy - Philosophy South

https://doi.org/10.4013/FSU.2017.183.11

Abstract

All reasoners described in the most widespread models of a rational reasoner exhibit logical omniscience, what is impossible for finite reasoners (real reasoners). The most common strategy for dealing with the problem of logical omniscience is to interpret the models using a notion of beliefs different from explicit beliefs. For example, the model could be interpreted as describing the beliefs that the reasoner would hold if the reasoner were able reason indefinitely (stable beliefs). Then the model would describe maximum rationality, what a finite reasoner can only approach in the limit of a reasoning sequence. This strategy has important consequences to epistemology. If a finite reasoner can only approach maximum rationality in the limit of a reasoning sequence, then the efficiency of reasoning is epistemically (and not only pragmatically) relevant. In section 1, I present an argument to this conclusion. In section 2, I discuss the consequences of this conclusion, as, for example, the vindication of the principle 'no rationality through brute-force'.

References (16)

  1. References ARTEMOV, S.; KUZNETS, R. 2014. Logical Omniscience as In- feasibility. Annals of Pure and Applied Logic, 165(1):6-25. https://doi.org/10.1016/j.apal.2013.07.003
  2. CONRAD, K. 2016. Orders of Growth. Available at: http://www. math.uconn.edu/~kconrad/blurbs/analysis/growth.pdf. Ac- cessed on: January 11, 2018.
  3. DANTAS, D. 2016. Almost Ideal: Computational Epistemolo- gy and the Limits of Rationality for Finite Reasoners. Davis, California. PhD dissertation. University of California, 160 p.
  4. DUC, H. 1995. Logical Omniscience vs. Logical Ignorance on a Dilemma of Epistemic Logic. In: Proceedings of the 7 th Portuguese Conference on Artificial Intelligence. London, UK, p. 237-248. https://doi.org/10.1007/3-540-60428-6_20
  5. FOLEY, R. 1987. The Theory of Epistemic Rationality. Cam- bridge, Harvard University Press, 335 p. https://doi.org/10.4159/harvard.9780674334236
  6. HINTIKKA, J. 1962. Knowledge and Belief: An Introduction to the Logic of the Two Notions. Ithaca, Cornell University Press, 148 p.
  7. A decision problem is a problem with a yes-or-no answer.
  8. To solve a decision problem is to return the correct answers for all instances of the problem; to check the solution of a decision prob- lem is to solve for all 'yes' instances of the problem.
  9. Nevertheless, most theorists work on the assumption that P ≠ NP. Filosofi a Unisinos -Unisinos Journal of Philosophy -18(3): 195-200, sep/dec 2017
  10. JAGO, M. 2006. Hintikka and Cresswell on Logical Omni- science. Logic and Logical Philosophy, 15(3):325-354.
  11. JAGO, M. 2013. The Problem of Rational Knowledge. Erken- ntnis, 79(S6):1-18.
  12. KELLY, K. 1988. Artificial Intelligence and Effective Epistemol- ogy. In: J. FETZER (ed.), Aspects of Artificial Intelligence. Amsterdam, Springer, p. 309-322. https://doi.org/10.1007/978-94-009-2699-8_11
  13. KROM, M. 1967. The Decision Problem for a Class of First-or- der Formulas in which All Disjunctions are Binary. Mathe- matical Logic Quarterly, 13(1-2):15-20. https://doi.org/10.1002/malq.19670130104
  14. MENZEL, C. 2016. Possible Worlds. In: E. ZALTA (ed.), The Stanford Encyclopedia of Philosophy. Stanford, Metaphys- ics Research Lab.
  15. SIPSER, M. 2012. Introduction to the Theory of Computation. Boston, Cengage Learning, 458 p.
  16. STALNAKER, R. 1991. The Problem of Logical Omniscience, I. Synthese, 89(3):425-440. https://doi.org/10.1007/BF00413506555 Submitted on November 20, 2017 Accepted on February 02, 2018