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
    Post's problem (1944) demonstrated that intermediate degr... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→Among the unsolvable decision problems of recursively enumerable sets, there is a highest degree of unsolvability.

    Post's problem (1944) demonstrated that intermediate degrees exist between decidable and complete r.e. sets, undermining claims of a single highest degree.

    ?Rate how convincing each reason is below to see the overall strength.
    1 reason for
    1 reason against

    Reasons For

    1 perspective
    Reason for
    ?
    • 1.Post's construction of intermediate degrees definitively proves the degree structure is non-linear, confirming genuine complexity gaps exist.
      ?

      Think about whether this reason is strong or weak

    • 2.The existence of intermediate r.e. degrees demonstrates Turing reducibility creates a rich hierarchy, not a binary decidable/undecidable partition.
      ?

      Think about whether this reason is strong or weak

    • 3.Post's result provides concrete mathematical evidence against oversimplified claims that undecidability represents a single 'top' difficulty level.
      ?

      Think about whether this reason is strong or weak

    Reasons Against

    1 perspective
    Reason against
    ?
    • 1.Post's theorem concerns only r.e. sets; intermediate degrees may not exist among all Turing degrees, limiting the scope of the general claim.
      ?

      Think about whether this reason is strong or weak

    • 2.The claim conflates 'multiple degrees' with 'no highest degree'—there could still be maximal degrees even with intermediate ones present.
      ?

      Think about whether this reason is strong or weak

    • 3.Post's work refutes a specific 1944-era conjecture but doesn't establish which degree-theoretic claims about undecidability were actually being defended.
      ?

      Think about whether this reason is strong or weak

    Sign in or register to share your perspective on this statement.

    Next step

    Based on where you are in your exploration

    Strongest counterpoint
    Explore the most compelling reason on the other side.

    Connections

    2 topics

    Truth & Knowledge1 linkedModality & Possibility1 linked

    Related

    Among the unsolvable decision problems of recursively enumerable sets, there is ...Post's construction of intermediate degrees definitively proves the degree struc...Post's result provides concrete mathematical evidence against oversimplified cla...Post's theorem concerns only r.e. sets; intermediate degrees may not exist among...
    +3 moreShow less
    Post's work refutes a specific 1944-era conjecture but doesn't establish which d...The claim conflates 'multiple degrees' with 'no highest degree'—there could stil...The existence of intermediate r.e. degrees demonstrates Turing reducibility crea...

    Details

    Type
    claim
    Perspectives
    2 (1 for, 1 against)
    Edits
    1 edit