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 a function can be uniformly computed for t... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Truth & Knowledge
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→Polynomial time computability captures the boundary of feasible computability (quasi-inductive argument for CET).

    In cases where a function can be uniformly computed for the class of instances of practical concern, this is typically because a polynomial time algorithm has been discovered that can be implemented on current hardware.

    All sources support itTruth & 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

    Truth & KnowledgeAll sources support it

    Key Terms

    Function(Boorse's account of biological function, grounding his theory of disease)
    A species-typical contribution to survival and reproduction
    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 Truth & Knowledge
    Related propositions within the same area of thought.
    algorithm(Philosophy of computation and information)
    A fundamental concept in information and computation theory, accepted as a primitive notion alongside data set
    hardware(in computing)
    The physical machines and electronic components of a computer—the parts you can touch, like the processor and memory chips.
    implemented(in technology)
    Put into actual use or practice—like taking a theoretical plan and making it work on a real computer.
    uniformly computed(in computer science)
    Solved or calculated in the same reliable way across all different cases or examples you might encounter.

    Connections

    1 topic

    Skepticism1 linked

    Related

    In cases where a function cannot be uniformly computed for all arguments of prac...In many practically intractable cases, there also exists circumstantial evidence...Polynomial time computability captures the boundary of feasible computability (q...

    Similar

    In cases where a function can be uniformly computed for practically re...96%In cases where we can uniformly compute the values of a function (or d...95%In cases where a function cannot be uniformly computed for all argumen...91%In practice, problems that can be solved uniformly for relevant instan...90%

    Source

    AI-extracted
    SEP: computational-complexity
    View source passageHide passage
    Edmonds (1965a) first proposed that polynomial time complexity could be used as a positive criterion of feasibility – or, as he put it, possessing a “good algorithm” – in a paper in which he showed that a problem which might a priori be thought to be solvable only by brute force search (a generalization of \(\sc{PERFECT}\ \sc{MATCHING}\) from above) was decidable by a polynomial time algorithm. Paralleling a similar study of brute force search in the Soviet Union, in a subsequent paper Edmonds

    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