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 cases where uniform computation is not currently possi... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Skepticism
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→Practical computability correlates with the existence of polynomial time algorithms.

    In cases where uniform computation is not currently possible, a polynomial time algorithm has typically not been discovered, and circumstantial evidence often suggests none 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

    Key Terms

    Circumstantial evidence(as used in logic and reasoning)
    Indirect clues or signs that suggest something is probably true, even though they don't prove it directly.
    Polynomial time algorithm(Used as the operative standard for what counts as feasibly computable in the argument for CET)
    An algorithm whose running time is bounded by a polynomial function of the input size, taken here as the criterion for practical uniform computability on current computing hardware and as a Turing machine.

    Next step

    Based on where you are in your exploration

    Browse more in Skepticism
    Related propositions within the same area of thought.
    Uniform computation(Distinguished from case-by-case or partial computation; the relevant standard for practical problem-solving)
    The ability to compute the values of a function (or decide a problem) for all instances in a relevant class using a single, general method.

    Related

    In cases where a function can be uniformly computed for practically relevant inp...Practical computability correlates with the existence of polynomial time algorit...

    Similar

    In many cases where no polynomial time algorithm is known, there is al...91%In cases where a function cannot be uniformly computed for all argumen...91%In cases where we are currently unable to uniformly compute the values...90%In many practically intractable cases, there also exists circumstantia...90%

    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