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 quasi-inductive argument for CT derives force from co... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→The Computational Efficiency Thesis (CET) is supported by a quasi-inductive argument analogous to the quasi-inductive argument for the Church-Turing Thesis (CT).

    The quasi-inductive argument for CT derives force from convergence across distinct computational models (Turing machines, lambda calculus, recursive functions), whereas CET lacks analogous model-independence.

    ?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.Multiple independent formal systems (TMs, lambda calculus, recursion) achieving identical computational boundaries strongly suggests discovering fundamental limits rather than arbitrary choices.
      ?

      Think about whether this reason is strong or weak

    • 2.CET lacks comparable cross-model convergence: embodied, quantum, and analog proposals each rest on distinct physical substrates without equivalent mathematical unification.
      ?

      Think about whether this reason is strong or weak

    • 3.Convergence across models designed without mutual influence provides stronger inductive evidence than single-model systems, reducing explanatory coincidence.
      ?

      Think about whether this reason is strong or weak

    Reasons Against

    1 perspective
    Reason against
    ?
    • 1.CT's 'convergence' may reflect shared mathematical foundations rather than empirical discovery—all models encode discrete symbol manipulation, so agreement is partly stipulative.
      ?

      Think about whether this reason is strong or weak

    • 2.CET models haven't achieved comparable formalization; their theoretical weakness versus CT doesn't prove CET false, only underdeveloped relative to mature frameworks.
      ?

      Think about whether this reason is strong or weak

    • 3.Model-independence itself lacks principled justification: why should solutions discovered via different formalisms carry more evidential weight than solutions solving real-world problems better?
      ?

      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.

    Key Terms

    CET(as used in philosophy of computation)
    An abbreviation for a specific philosophical thesis about computation (likely 'Computational Feasibility Thesis' or similar), but the exact meaning would depend on the source text.
    CT(The thesis whose acceptance is presupposed throughout the Stroud–Brueckner exchange; its exact formulation is not given in this passage.)
    An unnamed thesis or theory (likely a causal or connectedness theory of content) whose acceptance constrains what believers can conceive regarding the relationship between beliefs and mind-independent objects.
    Lambda calculus(as used in logic and computer science)
    A formal mathematical system for studying functions and how they work; it's another way of thinking about computation, alternative to Turing machines.
    Model-independence(as used in philosophy of computation)
    The quality of a conclusion being true or valid regardless of which method or framework you use to arrive at it; like getting the same answer whether you use different calculators.
    Quasi-inductive argument(as used in logic and philosophy of mind)
    A type of reasoning that isn't quite a traditional inductive argument (where you draw general conclusions from specific examples), but works similarly by building support through multiple pieces of evidence pointing in the same direction.
    Turing machines(as used in computer science and logic)
    A theoretical mathematical model of a simple computer invented by Alan Turing; it's used to study what kinds of problems computers can solve in principle.
    convergence(alternative to consensus-based public reason)
    A model of public justification that allows appeals to religious reasons, thereby not requiring exclusively secular justifications
    recursive functions(Distinguished from the concrete operations used to compute them.)
    Abstract relations defined on natural numbers that can in principle be defined without any reference to space and time.

    Connections

    2 topics

    All sources support it1 linkedTruth & Knowledge1 linked

    Related

    CET lacks comparable cross-model convergence: embodied, quantum, and analog prop...CET models haven't achieved comparable formalization; their theoretical weakness...

    Details

    Type
    claim
    Perspectives
    2 (1 for, 1 against)
    Edits
    1 edit
    CT's 'convergence' may reflect shared mathematical foundations rather than empir...
    Convergence across models designed without mutual influence provides stronger in...
    +3 moreShow less
    Model-independence itself lacks principled justification: why should solutions d...Multiple independent formal systems (TMs, lambda calculus, recursion) achieving ...The Computational Efficiency Thesis (CET) is supported by a quasi-inductive argu...