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
    Therefore the deterministic simulation requires exponenti... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Modality & Possibility
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→Polynomial-time decidability of a language by a non-deterministic Turing machine only guarantees that the language is decidable in exponential time by a deterministic Turing machine

    Therefore the deterministic simulation requires exponential time even when the non-deterministic machine runs in polynomial time

    Modality & PossibilityProof of definition segments
    ?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

    Modality & PossibilityProof of definition segments

    Related

    If a non-deterministic machine N has time complexity f(n), a deterministic simul...Polynomial-time decidability of a language by a non-deterministic Turing machine...When f(n) is polynomial, k^f(n) is exponential

    Next step

    Based on where you are in your exploration

    Browse more in Modality & Possibility
    Related propositions within the same area of thought.

    Similar

    A non-deterministic machine with space bound f(n) can be simulated det...86%A nondeterministic machine with space bound f(n) can be simulated dete...83%A non-deterministic machine with running time f(n) can be simulated by...81%A PRAM machine can efficiently simulate a non-deterministic Turing mac...80%

    Source

    AI-extracted
    SEP: computational-complexity
    View source passageHide passage
    1 Deterministic and non-deterministic models of computation According to the Cobham-Edmonds Thesis the complexity class \(\textbf{P}\) describes the class of feasibily decidable problems. As we have just seen, this class is defined in terms of the reference model \(\mathfrak{T}\) in virtue of the assumption that it is a ‘reasonable’ model of computation. Several other models of computation are also studied in complexity theory not because they are presumed to be accurate representations of the c

    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