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
    Exponentiation grows at a super-polynomial rate — Carmelics
    Home/Truth & Knowledge
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→Exponentiation is not provably total in IΔ₀

    Exponentiation grows at a super-polynomial rate

    Proof of definition segmentsTruth & 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 & KnowledgeProof of definition segments

    Connections

    1 topic

    Skepticism1 linked

    Related

    Next step

    Based on where you are in your exploration

    Browse more in Truth & Knowledge
    Related propositions within the same area of thought.
    All provably total functions of IΔ₀ are of polynomial rate of growthExponentiation is not provably total in IΔ₀Parikh's theorem entails that IΔ₀ can only prove totality for functions bounded ...

    Similar

    Exponentiation grows faster than any polynomial88%The exponentiation function grows at super-polynomial (exponential) ra...88%O(2^n) and all other super-polynomial rates of growth sit strictly abo...84%Super-polynomial orders of growth such as O(2^n) are not feasible.78%

    Source

    AI-extracted
    SEP: computational-complexity
    View source passageHide passage
    The logic \(\textsf{SO}(\texttt{LFP})\) and \(\textsf{SO}(\texttt{TC})\) are defined analogously by adding these operators to \(\textsf{SO}\) and allowing them to apply to formulas containing second-order variables. e. models \(\mathcal{A}\) for structures interpreting \(\leq\) as a linear order on \(A\)). Immerman (1999, p. 3 as “increas[ing] our intuition that polynomial time is a class whose fundamental nature goes beyond the machine models with which it is usually defined”. e. \(\textbf{P} \

    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