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 generalized account of rationality must be informed by ... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Skepticism
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→The use of heuristics—even potentially unsound ones—should be regarded as falling under a generalized account of rationality

    A generalized account of rationality must be informed by computational complexity theory

    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

    Related

    Heuristics may be of benefit to an agent in certain circumstancesMinimal rationality only requires that an agent make some valid inferences, not ...The use of heuristics—even potentially unsound ones—should be regarded as fallin...

    Next step

    Based on where you are in your exploration

    Browse more in Skepticism
    Related propositions within the same area of thought.

    Similar

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

    Source

    AI-extracted
    SEP: computational-complexity
    View source passageHide passage
    as hard as the Halting Problem). g. Levesque 1984; Stalnaker 1991; 1999). Another reaction has been to attempt to modify the interpretation of the language of epistemic logic to mitigate the effects of (i) and (ii). g. through the use of so-called impossible worlds (Rantala 1982), awareness models (Fagin and Halpern 1988), or local models (Fagin and Halpern 1988). g. that knowledge of a conjunction entails knowledge of its conjuncts). An approach to logical omniscience which explicitly takes com

    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