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
    Hartmanis and Simon demonstrated that parallelism can yie... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→Members of the first machine class should be considered reasonable models of computation for formulating the Cobham-Edmonds Thesis

    Hartmanis and Simon demonstrated that parallelism can yield exponential speedups, meaning first machine class membership fails to capture the true cost of physically realizable computation.

    ?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.

    Key Terms

    Exponential speedups(in describing computational performance improvements)
    When adding more parallel workers makes a task dramatically faster—not just twice as fast with twice the workers, but potentially thousands of times faster.
    Hartmanis and Simon(as referenced in computer science and computational complexity)
    Juris Hartmanis and Herbert Simon are computer scientists who studied how different ways of measuring computer performance can give different results depending on the machine you're using.
    Machine class membership(in computer science classification)
    A way of categorizing or grouping different types of computers or computational systems based on their basic capabilities.
    Parallelism(as the claim being refuted)
    The property or concept of lines (or things) being parallel—existing alongside each other without ever meeting.

    Next step

    Based on where you are in your exploration

    Explore a random proposition
    Start fresh with something unrelated.
    Physically realizable computation(philosophy of physics and computation)
    Calculations or information processing that can actually be performed by real, physical computers or devices in the real world, as opposed to purely theoretical or imaginary computers.

    Connections

    2 topics

    All sources support it1 linkedProof of definition segments1 linked

    Related

    Members of the first machine class should be considered reasonable models of com...

    Details

    Type
    claim
    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