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
    If feasibility is purely a property of growth functions, ... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→In complexity theory, feasibility is a property of time complexity functions or their rates of growth, not of individual natural numbers.

    If feasibility is purely a property of growth functions, then no fact about any individual natural number can bear on whether a computation is feasible, which is computationally absurd.

    ?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

    Computationally absurd(philosophy of computation)
    A conclusion that makes no sense from the perspective of how computers actually work and what they can realistically do.
    Feasibility(as used in logic and computation)
    Whether something is actually possible to do in practice, considering real-world limitations like time and resources—not just theoretically possible.
    Growth functions(mathematics and computer science)
    Mathematical descriptions of how quickly something increases; in computing, they measure how much harder a problem becomes as the input gets bigger.
    Natural number(Frege-style logicist definition used in the proof)
    A number n such that Precedes⁺(0,n) holds — i.e., 0 bears the strong ancestral of the Precedes relation to n
    computation

    Next step

    Based on where you are in your exploration

    Explore a random proposition
    Start fresh with something unrelated.
    (Used to establish the upper bound of what any computing system must do)
    A finite function between finite data sets, requiring finite and discrete inputs, outputs, and computation time.
    property(Locke's demonstration of the moral proposition 'Where there is no property, there is no injustice.')
    A right to something.

    Connections

    2 topics

    Truth & Knowledge1 linkedSkepticism1 linked

    Related

    In complexity theory, feasibility is a property of time complexity functions or ...

    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