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
    Conflating worst-case asymptotic complexity with practica... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→Exponential time complexity is a sufficient condition for classifying a decidable problem as intractable.

    Conflating worst-case asymptotic complexity with practical intractability commits the error Cobham and Edmonds warned against: mistaking mathematical elegance for physical reality.

    ?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.

    Key Terms

    Alan Turing (implied reference to Cobham-Edmonds thesis)(in computational theory)
    Note: The statement refers to work by Cobham and Edmonds on the boundary between what's theoretically solvable and what's practically solvable on real computers.
    Asymptotic complexity(in computer science and mathematics)
    A way of measuring how much harder a computer problem gets as the amount of data grows—focusing on the worst-case scenario as the data becomes very large.
    Conflating
    Conflating means mixing together or treating two different things as if they were the same thing, when they're actually distinct. It's a logical error where someone blurs important differences between concepts, ideas, or situations to make an argument seem stronger than it is. For example, conflating "being critical of a policy" with "being disloyal to your country" wrongly equates two separate things.
    Intractability(used to describe problems that seem impossible to solve in practice)
    When a problem is so difficult for a computer to solve that it would take an unreasonably long time, even with the best algorithms.

    Next step

    Based on where you are in your exploration

    Explore a random proposition
    Start fresh with something unrelated.
    Jack Edmonds(in computer science history)
    A pioneering computer scientist who argued in the 1960s that we should care about algorithms that run in 'polynomial time' (reasonably fast) rather than just any mathematically correct solution.
    Mathematical elegance(as used to describe why scientists might be tempted to accept a theory without other good reasons)
    When a mathematical system or formula is simple, beautiful, and works smoothly—even if it might not match reality.

    Connections

    1 topic

    Truth & Knowledge1 linked

    Related

    Exponential time complexity is a sufficient condition for classifying a decidabl...

    Details

    Type
    claim
    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