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
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    NP-complete problems are computationally intractable unde... — Carmelics
    Home/Philosophy of Language
    HistoryEditSee Inverse

    Connected to 2 discussions

    Supports→Consistency checking among a finite set of sentences is computationally intractable for everyday reasoning.
    Supports→Consistency checking of finite sentence sets is computationally intractable.

    NP-complete problems are computationally intractable under the Cobham-Edmonds Thesis.

    Philosophy of LanguageTruth & 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

    Philosophy of LanguageTruth & Knowledge

    Connections

    2 topics

    Modality & Possibility1 linked

    Next step

    Based on where you are in your exploration

    Browse more in Philosophy of Language
    Related propositions within the same area of thought.
    Skepticism
    1 linked

    Related

    Consistency checking among a finite set of sentences is computationally intracta...Consistency checking is a re-description of the canonical NP-complete problem SA...Consistency checking of finite sentence sets is computationally intractable.Determining whether a finite set of sentences is consistent is equivalent to the...

    Similar

    NP-complete problems are computationally intractable under the Cobham-...99%coNP-complete problems are very likely intractable.89%Showing that a problem X is NP-complete establishes that no feasible a...87%Showing that a problem X is NP-complete is evidence that X has no feas...87%

    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