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

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

    Reasons Against

    5 perspectives
    Reason against 1 of 5
    ?
    • 1.The standard Turing machine model corresponds to a special case of the probabilistic Turing machine model
      ?

      Think about whether this reason is strong or weak

    • 2.BPP includes all problems decidable by a probabilistic Turing machine running in polynomial time with bounded error probability
      ?

      Think about whether this reason is strong or weak

    Reason against 2 of 5
    ?
    • 1.The standard deterministic Turing machine model is a special case of the probabilistic Turing machine model
      ?

      Think about whether this reason is strong or weak

    • 2.BPP is defined to include all problems solvable by a probabilistic Turing machine in polynomial time with error probability bounded away from one-half
      ?

      Think about whether this reason is strong or weak

    Reason against 3 of 5
    ?
    • 1.The standard Turing machine model is a special case of the probabilistic Turing machine model
      ?

      Think about whether this reason is strong or weak

    • 2.BPP is defined to include all problems solvable by probabilistic Turing machines in polynomial time with bounded error
      ?

      Think about whether this reason is strong or weak

    Reason against 4 of 5
    ?
    • 1.The standard Turing machine model corresponds to a special case of the probabilistic computation model
      ?

      Think about whether this reason is strong or weak

    • 2.Any problem solvable by a deterministic Turing machine is also solvable by a probabilistic one
      ?

      Think about whether this reason is strong or weak

    Reason against 5 of 5
    ?
    • The standard deterministic Turing machine model is a special case of the probabilistic Turing machine model used to define BPP
      ?

      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.