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
    NFL theorems are mathematical results about aggregate per... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→The No-Free-Lunch theorems are versions of the argument in Hume's first fork

    NFL theorems are mathematical results about aggregate performance over all possible functions, while Hume's fork addresses whether a single proposition's negation implies contradiction.

    ?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

    Aggregate performance(as used in statistics and evaluation)
    Overall results when you combine or add up results across many different cases or situations.
    David Hume(as referenced in the statement)
    An 18th-century Scottish philosopher who argued that our desires and emotions, not reason alone, drive our actions and decisions.
    Hume's Fork(Often used with the negative implication that Hume may be illicitly excluding meaningful propositions)
    The distinction between relations of ideas and matters of fact, dividing all propositions into these two categories
    NFL theorems(as used in theoretical computer science and philosophy of learning)
    A set of mathematical theorems (proven rules) that show certain learning algorithms can't be universally good at solving all possible problems—they work well on some but not others.

    Next step

    Based on where you are in your exploration

    Explore a random proposition
    Start fresh with something unrelated.
    contradiction(Relevant to distinguishing contradictions from false contingent statements in the logic student variant of the preface paradox.)
    A statement that is necessarily false in all interpretations; in this context, specifically the negation of a tautology or any falsehood drawn from a list containing only tautologies and contradictions.
    negation(Standard truth conditions for logical negation, used as the basis for arguments against dialetheism)
    ¬A is true if and only if A is not true
    proposition(Used in the context of a semantic theory sensitive to differences in subject matter.)
    The content expressed by a sentence, individuated at least in part by the subject matter of the sentence and the contents of its subsentential expressions.

    Connections

    2 topics

    Truth & Knowledge1 linkedSkepticism1 linked

    Related

    The No-Free-Lunch theorems are versions of the argument in Hume's first fork

    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