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 υ(i,x) were total, then d(j) would be defined, leading... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Modality & Possibility
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→The universal partial computable function υ(i,x) is not total (i.e., not computable everywhere)

    If υ(i,x) were total, then d(j) would be defined, leading to a contradiction via diagonalization

    Modality & PossibilityTruth & Knowledge
    ?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 & PossibilityTruth & Knowledge

    Connections

    3 topics

    Proof of definition segments1 linked

    Next step

    Based on where you are in your exploration

    Browse more in Modality & Possibility
    Related propositions within the same area of thought.
    Causation
    1 linked
    Skepticism1 linked

    Related

    Define d(x) = υ(x,x) + 1, which is partial computable since υ(i,x) is partial co...Since d(x) is partial computable, d(x) ≃ φ_j(x) for some index jThe universal partial computable function υ(i,x) is not total (i.e., not computa...υ(i,x) is a universal partial computable function

    Similar

    If δ coincided with g_j, then g_j(j) = δ(j) = g_j(j) + 1, which is a c...75%CL establishes a diagonal contradiction for any purported surjection f...75%Since g_i(x) is always defined (total), u_k(i,x) is not merely partial...70%A proof of P ≠ NP based on diagonalization would relativize to both or...70%

    Source

    AI-extracted
    SEP: recursive-functions
    View source passageHide passage
    Having just seen that there is a universal partial computable function \(\upsilon(i,x)\), a natural question is whether this function is also computable (i.e., total). A negative answer is provided immediately by observing that by using \(\upsilon(i,x)\) we may define another modified diagonal function \(d(x) = \upsilon(x,x) + 1\) which is partial computable (since \(\upsilon(i,x)\) is). This in turn implies that \(d(x) \simeq \phi_j(x)\) for some \(j\). But now note that if \(\upsilon(i,x)\) we

    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