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

    Part of a larger discussion

    Supports→The use of heuristics—including potentially unsound ones—can fall within a generalized account of rationality.

    A theory of rationality informed by computational complexity theory should accommodate feasible inference strategies.

    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

    3 topics

    Virtue Ethics2 linked

    Next step

    Based on where you are in your exploration

    Browse more in Skepticism
    Related propositions within the same area of thought.
    Moral Responsibility
    2 linked
    Consciousness & Mind1 linked

    Related

    Heuristics considered by cognitive psychologists may be of benefit to agents in ...Human agents face resource limitations that make computationally optimal reasoni...The use of heuristics—including potentially unsound ones—can fall within a gener...

    Similar

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

    Source

    AI-extracted
    SEP: computational-complexity
    View source passageHide passage
    Note, however, that such theorists are typically careful to avoid explicitly asserting that there are only finitely many feasible numbers. g. those given in the formulation of (S2). Certainly the claim that there is a largest feasibly constructible number would invite the challenge that the strict finitist nominate such a number \(n\). And any such nomination would in turn invite the rejoinder that if \(n\) is feasibly constructible, then \(n+1\) must be as well. But in the sort of model \(\math

    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