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 function computable only by an algorithm with time comp... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Modality & Possibility
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→The Cobham-Edmonds Thesis's definition of feasibility is practically inadequate.

    A function computable only by an algorithm with time complexity 2^1000 * n or n^1000 would be classified as feasible under CET.

    Modality & PossibilityTruth & 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

    Modality & PossibilityTruth & Knowledge

    Connections

    1 topic

    Skepticism3 linked

    Related

    Next step

    Based on where you are in your exploration

    Browse more in Modality & Possibility
    Related propositions within the same area of thought.
    CET classifies as feasible any function computable in polynomial time, regardles...Such functions could not be computed in practice for most or all inputs, contrad...The Cobham-Edmonds Thesis's definition of feasibility is practically inadequate.

    Similar

    An algorithm with time complexity 2^1000 * n or n^1000 would be classi...96%CET classifies as feasible functions computable only by algorithms wit...89%Functions requiring algorithms with time complexity such as 2^1000·n o...88%CET counts as feasible any algorithm with time complexity c * n^k rega...88%

    Source

    AI-extracted
    SEP: computational-complexity
    View source passageHide passage
    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 values of a function (or decide a problem) for all arguments in which we take interest, it is t

    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