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 Factorization is not efficient, even though an effective procedure for it exists

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

    Reasons For

    2 perspectives
    Reason for 1 of 2
    ?
    • 1.Efficiency is not an intrinsic property of a problem but is relative to computational model, input encoding, and available resources.
      ?

      Think about whether this reason is strong or weak

    • 2.The claim conflates trial division (one inefficient algorithm) with factorization as a class, ignoring sub-exponential methods like the general number field sieve.
      ?

      Think about whether this reason is strong or weak

    • 3.Since no proof exists that factorization lacks a polynomial-time algorithm, asserting it is 'not efficient' asserts an unresolved conjecture as established fact.
      ?

      Think about whether this reason is strong or weak

    Reason for 2 of 2
    ?
    • 1.Church-Turing thesis variants (e.g., the efficient Church-Turing thesis) are contested, meaning what counts as 'effective' versus 'efficient' may not be sharply distinguishable.
      ?

      Think about whether this reason is strong or weak

    • 2.Shor's quantum algorithm solves integer factorization in polynomial time, demonstrating that efficiency is model-dependent, not inherent to the problem's logical structure.
      ?

      Think about whether this reason is strong or weak

    Reasons Against

    1 perspective
    Reason against
    ?
    • 1.Multiplication conserves information, making it reversible to some extent
      ?

      Think about whether this reason is strong or weak

    • 2.Finding the unique set of primes for a natural number n is called factorization
      ?

      Think about whether this reason is strong or weak

    • 3.An effective procedure exists: try dividing n by all numbers between 1 and √n
      ?

      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.