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
    Kreisel's analysis shows undecidability results like the ... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→The justification for classifying specific problems as undecidable can be no stronger than the confidence placed in Church's Thesis.

    Kreisel's analysis shows undecidability results like the halting problem can be established relative only to the formal system itself, without invoking Church's Thesis as a bridge principle to informal effectivity.

    ?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

    Bridge principle(describes how Church's Thesis was being used)
    An assumption or rule that connects two different domains—in this case, connecting what's theoretically computable to what's actually doable in practice.
    Church's Thesis(Also called the Church-Turing Thesis; surveyed in Section 1.6 of the source text.)
    The claim that the class REC coincides with the class of effectively computable functions.
    Formal system(as used in logic and mathematics)
    A set of rules and symbols (like mathematical axioms) that you use to prove whether statements are true or false, similar to how a chess game has specific rules that determine what moves are legal.
    Informal effectivity(what Church's Thesis bridges toward)
    The idea that something can be done in practice by a human using intuition and common sense, without needing a formal set of rules.

    Next step

    Based on where you are in your exploration

    Explore a random proposition
    Start fresh with something unrelated.
    Kreisel(as a historical figure in logic and philosophy of mathematics)
    Georg Kreisel (1923–2015), a mathematical logician who studied how mathematical reasoning works and whether we can be certain about mathematical truths.
    The halting problem(as a theoretical problem that seemed pointless but became foundational to computer science)
    A famous question Turing asked: 'Can you write a set of instructions that can tell whether any other set of instructions will eventually finish running or keep going forever?' The answer turns out to be no—it's impossible.
    Undecidability(Wittgenstein's usage in PR §174, alluding to algorithmic decidability)
    The condition in which a bridge (connection) between symbols cannot be made with symbols.

    Connections

    2 topics

    Truth & Knowledge1 linkedSkepticism1 linked

    Related

    The justification for classifying specific problems as undecidable can be no str...

    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