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
    All provably total functions of IΔ₀ are of polynomial rat... — Carmelics
    Home/Truth & Knowledge
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→Exponentiation is not provably total in IΔ₀

    All provably total functions of IΔ₀ are of polynomial rate of growth

    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 linked claim · 3 topics

    All sources support it1 linked

    Next step

    Based on where you are in your exploration

    Browse more in Truth & Knowledge
    Related propositions within the same area of thought.
    Modality & Possibility
    1 linked
    Skepticism1 linked
    All provably total functions of IΔ_0 are of polynomial rate of growth

    Related

    All provably total functions of IΔ_0 are of polynomial rate of growthExponentiation grows at a super-polynomial rateExponentiation grows faster than any polynomialExponentiation is not provably total in IΔ₀
    +1 moreShow less
    Parikh's theorem entails that IΔ₀ can only prove totality for functions bounded ...

    Similar

    All provably total functions of IΔ_0 are of polynomial rate of growth98%The provably total functions of S¹₂ correspond to the polynomial-time ...83%A function f(x) is computable in polynomial time if and only if f(x) i...78%Buss (1986) proved that the provably total functions of S^i_2 correspo...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