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
    If a parallel algorithm requires exponentially many proce... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Skepticism
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→Parallel computation using exponentially many processors relative to input size would be of little practical significance

    If a parallel algorithm requires exponentially many processors relative to input size, there is little hope of building a computing device on which it could be concretely implemented

    Modality & PossibilitySkepticism
    ?Rate how convincing each reason is below to see the overall strength.

    No one has weighed in yet. Be the first to share reasons for or against this statement.

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

    Topics

    SkepticismModality & Possibility

    Key Terms

    Concrete implementation(technology/philosophy of computing)
    Actually building and running something in the real world, rather than just thinking about it theoretically on paper.
    Exponentially(as used in mathematics and chaos theory)
    Growing or increasing at an accelerating rate, like doubling again and again—so small differences become huge ones very quickly.
    Input size(as used in computer science)

    Next step

    Based on where you are in your exploration

    Browse more in Skepticism
    Related propositions within the same area of thought.
    How much data or how many items a program needs to process; for example, the number of items in a list you're sorting.
    Parallel algorithm(computer science/computational theory)
    A set of computational steps designed to be executed simultaneously across multiple processors or computers working together, rather than one after another on a single processor.
    Processors(as used in computer science)
    The computing chips or units that actually do the calculations and execute instructions in a computer.

    Connections

    1 topic

    Truth & Knowledge1 linked

    Related

    Parallel computation using exponentially many processors relative to input size ...

    Similar

    If a parallel algorithm achieves speedup only by employing exponential...95%If parallel algorithms achieve speedup only at the cost of exponential...94%If parallel speedup requires exponentially many processors relative to...89%Parallel algorithms that require exponentially many processors relativ...87%

    Source

    AI-extracted
    SEP: computational-complexity
    View source passageHide passage
    Nonetheless, \(\mathfrak{P}\) is a useful theoretical model in that it provides a formal medium for implementing procedures which call for certain operations to be carried out simultaneously in parallel. g. , Papadimitriou 1994). But this observation would still be of little practical significance if the algorithms in question achieved such speed up only at the cost of having to employ exponentially many processors relative to the size of their inputs. For in this case it seems that we would hav

    Details

    Type
    premise
    Perspectives
    0 (0 for, 0 against)
    Edits
    1 edit

    Open for perspectives

    This idea is waiting for its first supporting or challenging perspective.

    Share the first perspective