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
    Home/Original/inverse
    See Original
    Inverse View

    It is not the case that NSPACE(f(n)) is a subset of TIME(2^O(f(n)))

    ?Set your confidence on the premises below to see your aggregate.

    Reasons For

    2 perspectives
    Reason for 1 of 2
    ?
    • 1.The simulation argument presupposes that non-deterministic computation is reducible to deterministic processes without epistemic loss.
      ?

      Think about whether this reason is strong or weak

    • 2.Kripke's possible-worlds semantics suggests non-deterministic branching represents genuinely distinct modal trajectories, not mere syntactic abbreviation.
      ?

      Think about whether this reason is strong or weak

    • 3.If non-determinism tracks real modal structure, the exponential blowup in simulation reflects ontological inflation, not mere computational overhead, undermining the subset claim's scope.
      ?

      Think about whether this reason is strong or weak

    Reason for 2 of 2
    ?
    • 1.The claim that NSPACE(f(n)) ⊆ TIME(2^O(f(n))) relies on f(n) being space-constructible, a condition that smuggles in a non-trivial computability assumption.
      ?

      Think about whether this reason is strong or weak

    • 2.Constructibility requirements, as Blum's axioms show, are not purely formal but encode substantive constraints on what counts as a legitimate resource measure.
      ?

      Think about whether this reason is strong or weak

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

      Think about whether this reason is strong or weak

    Reasons Against

    1 perspective
    Reason against
    ?
    • 1.f(n) is both time and space constructible
      ?

      Think about whether this reason is strong or weak

    • 2.A non-deterministic machine with space bound f(n) can be simulated deterministically in exponential time
      ?

      Think about whether this reason is strong or weak

    Next step

    Based on where you are in your exploration

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