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 NC is a subset of P

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

    Reasons Against

    4 perspectives
    Reason against 1 of 4
    ?
    • 1.Any PRAM machine which runs in time O(log^c(n)) using O(n^k) processors can be simulated by a polynomial time sequential machine
      ?

      Think about whether this reason is strong or weak

    • 2.NC is defined as the class of problems solvable in polylogarithmic time using polynomially many processors
      ?

      Think about whether this reason is strong or weak

    Reason against 2 of 4
    ?
    • 1.Any PRAM machine running in time O(log^c(n)) using O(n^k) processors can be simulated by a polynomial-time sequential machine
      ?

      Think about whether this reason is strong or weak

    • 2.NC is defined as the class of problems solvable by PRAM machines in polylogarithmic time with polynomially many processors
      ?

      Think about whether this reason is strong or weak

    Reason against 3 of 4
    ?
    • 1.Any PRAM machine which runs in time O(log^c(n)) using O(n^k) processors can be simulated by a polynomial time sequential machine
      ?

      Think about whether this reason is strong or weak

    • 2.NC is defined as the class of problems solvable by PRAM machines running in polylogarithmic time with polynomially many processors
      ?

      Think about whether this reason is strong or weak

    Reason against 4 of 4
    ?
    • 1.Any PRAM machine running in time O(log^c(n)) using O(n^k) processors can be simulated by a polynomial time sequential machine
      ?

      Think about whether this reason is strong or weak

    • 2.NC is defined as the class of problems solvable by PRAM machines in polylogarithmic time with polynomially many processors
      ?

      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.