Skip to content
Carmelics
TopicsThinkersChangesContributorsLoading account…

    Carmelics

    A reasoning platform. Break down any belief into clear reasons, explore both sides, and weigh the evidence honestly.

    Navigate

    • Topics
    • Search
    • Recent Changes
    • Contribute
    • How It Works
    • Glossary
    • Thinkers
    • Contributors
    • About
    • Statistics
    • Terms
    • Privacy

    Database

    Statements
    —
    Perspectives
    —
    Topics
    —

    Press ? for keyboard shortcuts

    LoyalLoyalJusticeJustice
    Made withinDC&Austin
    A rationality account informed by computational complexit... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Skepticism
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→The use of potentially unsound heuristics should be regarded as falling within a generalized account of rationality.

    A rationality account informed by computational complexity theory permits inference strategies that are not deductively complete.

    SkepticismTruth & Knowledge
    ?Rate how convincing each reason is below to see the overall strength.

    No one has weighed in yet. Be the first to share reasons for or against this statement.

    Sign in or register to share your perspective on this statement.

    Topics

    SkepticismTruth & Knowledge

    Connections

    1 topic

    Moral Responsibility2 linked

    Related

    Next step

    Based on where you are in your exploration

    Browse more in Skepticism
    Related propositions within the same area of thought.
    Heuristics of the kind studied by cognitive psychologists such as Tversky and Ka...The use of potentially unsound heuristics should be regarded as falling within a...

    Similar

    A theory of rationality informed by computational complexity theory sh...95%A generalized account of rationality informed by computational complex...91%A theory of rationality must be responsive to complexity-theoretic res...91%A generalized account of rationality must be informed by computational...91%

    Source

    AI-extracted
    SEP: computational-complexity
    View source passageHide passage
    \(\neg K_i \phi \rightarrow K_i \neg K_i \phi\), which expresses that \(i\)’s failure to know \(\phi\) entails that he knows of this failure – are considered more controversial. , Hintikka 1962; Lenzen 1978; Fagin et al. 1995) is that the most defensible choices of logics of knowledge lie between the modal systems \(\textsf{S4}\) and \(\textsf{S5}\). [56] Note, however, that both of these results seem prima facie implausible relative to our everyday understanding of knowledge. For on the one han

    Details

    Type
    premise
    Perspectives
    0 (0 for, 0 against)
    Edits
    1 edit

    Open for perspectives

    This idea is waiting for its first supporting or challenging perspective.

    Share the first perspective