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
    The proof that n^k*log(n^k)/n^{k+1} approaches 0 establis... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→TIME(n^k) is always a proper subset of TIME(n^{k+1}) for all natural numbers k

    The proof that n^k*log(n^k)/n^{k+1} approaches 0 establishes a limit condition, but the theorem yields only the existence of some language separating the classes, not a constructive or uniform witness.

    ?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

    Existence proof(as used in mathematical logic)
    A logical argument that shows *something* exists or is true, without necessarily showing you how to find it or build it yourself.
    Language (in computational context)(as used in computational theory and formal language theory)
    A formal set of strings or symbols that follow specific rules—used in computer science to represent problems or classes of information.
    Limit condition(as used in mathematical logic and computability theory)
    A mathematical boundary or endpoint that a formula or process approaches but may never quite reach—like how 1/n gets closer and closer to 0 the bigger n gets.
    Separating (classes)(as used in computational complexity and formal language theory)
    Creating a distinction or boundary that can tell two different groups apart—like drawing a line that keeps one category on one side and another category on the other.

    Next step

    Based on where you are in your exploration

    Explore a random proposition
    Start fresh with something unrelated.
    Theorem
    A theorem is a statement that has been proven to be true through logical reasoning and evidence. It's a fact that mathematicians or scientists have carefully verified using step-by-step arguments, starting from things already known to be true. Once proven, theorems become reliable building blocks that others can use to prove even more complex ideas.
    Uniform witness(as used in theoretical computer science and logic)
    A single method or solution that works the same way in all cases, rather than different solutions needed for different situations.
    constructive proof(Used to describe Turing and Church's proofs of undecidability/incompleteness results)
    A proof that shows how to effectively transform an individual instance of one model into another structure, providing an explicit construction rather than merely asserting existence

    Connections

    2 topics

    Proof of definition segments1 linkedModality & Possibility1 linked

    Related

    TIME(n^k) is always a proper subset of TIME(n^{k+1}) for all natural numbers k

    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