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
    In many cases where no polynomial time algorithm is known... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Skepticism
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→The Computational Efficiency Thesis (CET) is supported by a quasi-inductive argument analogous to the quasi-inductive argument for the Church-Turing Thesis (CT).

    In many cases where no polynomial time algorithm is known, there is also circumstantial evidence that no such algorithm can exist.

    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

    All sources support it1 linked

    Related

    Next step

    Based on where you are in your exploration

    Browse more in Skepticism
    Related propositions within the same area of thought.
    In cases where we are currently unable to uniformly compute the values of a func...In cases where we can uniformly compute the values of a function (or decide a pr...The Computational Efficiency Thesis (CET) is supported by a quasi-inductive argu...

    Similar

    In many practically intractable cases, there also exists circumstantia...94%In cases where uniform computation is not currently possible, a polyno...91%This strongly suggests no such polynomial time algorithm exists91%It is unlikely that a polynomial time algorithm exists for any NP-comp...89%

    Source

    AI-extracted
    SEP: computational-complexity
    View source passageHide passage
    It is also possible to make a case for CET which parallels the quasi-inductive argument for CT. For in cases where we can compute the values of a function (or decide a problem) uniformly for the class of instances we are concerned with in practice, this is typically so precisely because we have discovered a polynomial time algorithm which can be implemented on current computing hardware (and hence also as a Turing machine). And in instances where we are currently unable to uniformly compute the

    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