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
    A complexity inclusion whose proof boundary depends on co... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→NSPACE(f(n)) is a subset of TIME(2^O(f(n)))

    A complexity inclusion whose proof boundary depends on contested resource-theoretic assumptions cannot be taken as a necessary truth about computational possibility.

    ?Rate how convincing each reason is below to see the overall strength.
    1 reason for
    1 reason against

    Reasons For

    1 perspective
    Reason for
    ?
    • 1.Resource-theoretic assumptions (like P vs NP implications) remain unproven and philosophically contested in fundamental ways.
      ?

      Think about whether this reason is strong or weak

    • 2.Necessity claims require independence from disputed foundational assumptions, else they express conditional rather than absolute truths.
      ?

      Think about whether this reason is strong or weak

    • 3.A proof's reliability for necessity depends on its axioms being non-contingent; contested assumptions introduce contingency.
      ?

      Think about whether this reason is strong or weak

    Reasons Against

    1 perspective
    Reason against
    ?
    • 1.Many accepted mathematical necessities (e.g., Gödel's theorems) rest on foundational axioms that are themselves philosophically contested.
      ?

      Think about whether this reason is strong or weak

    • 2.Contestation doesn't eliminate necessity—it reflects epistemic uncertainty about which framework correctly describes computational reality.
      ?

      Think about whether this reason is strong or weak

    • 3.Distinguishing 'necessary given framework X' from 'metaphysically necessary' doesn't undermine the claim's legitimacy as mathematical truth.
      ?

      Think about whether this reason is strong or weak

    Sign in or register to share your perspective on this statement.

    Next step

    Based on where you are in your exploration

    Strongest counterpoint
    Explore the most compelling reason on the other side.

    Connections

    2 topics

    Truth & Knowledge1 linkedModality & Possibility1 linked

    Related

    A proof's reliability for necessity depends on its axioms being non-contingent; ...Contestation doesn't eliminate necessity—it reflects epistemic uncertainty about...Distinguishing 'necessary given framework X' from 'metaphysically necessary' doe...Many accepted mathematical necessities (e.g., Gödel's theorems) rest on foundati...
    +3 moreShow less
    NSPACE(f(n)) is a subset of TIME(2^O(f(n)))Necessity claims require independence from disputed foundational assumptions, el...Resource-theoretic assumptions (like P vs NP implications) remain unproven and p...

    Details

    Type
    claim
    Perspectives
    2 (1 for, 1 against)
    Edits
    1 edit