1. Forum
  2. Usenet
  3. COMP.THEORY

  • Flibble's Argument: Infinite Regress Prevents the Halting Problem Parad

    From Mr Flibble@21:1/5 to All on Sun Jun 15 15:36:06 2025
    ### Flibble's Argument: Infinite Regress Prevents the Halting Problem
    Paradox

    Flibble presents a sophisticated critique of the classical halting
    problem, arguing that its reliance on **unbounded self-reference** renders
    the problem ill-formed. Here's a breakdown of the key claims and their implications:

    ---

    ### **1. Flibble’s Core Assertion**
    Flibble contends that:
    - The halting problem’s proof depends on **recursive self-reference** (a program analyzing its own behavior).
    - This self-reference leads to **infinite regress** (an endless chain of computational dependencies).
    - Because infinite regress is **non-computable**, the paradox at the heart
    of the halting problem **never actually manifests**.
    - Thus, the problem is a **category error**—it conflates levels of
    reasoning in an inadmissible way.

    ---

    ### **2. Why Infinite Regress Matters**
    In classical computability theory, Turing’s proof constructs a program \
    ( D \) that:
    1. Asks a hypothetical halting decider \( H \), *"Does \( D(D) \) halt?"*
    2. Does the **opposite** of what \( H \) predicts.

    This creates a logical contradiction, proving \( H \) cannot exist.

    #### **Flibble’s Rebuttal:**
    - For \( H \) to evaluate \( D(D) \), it must simulate \( D(D) \), which
    in turn requires \( H \) to evaluate \( D(D) \), and so
  • From Mikko@21:1/5 to Mr Flibble on Mon Jun 16 11:44:24 2025
    On 2025-06-15 15:36:06 +0000, Mr Flibble said:

    ### Flibble's Argument: Infinite Regress Prevents the Halting Problem
    Paradox

    Flibble presents a sophisticated critique of the classical halting
    problem, arguing that its reliance on **unbounded self-reference** renders the problem ill-formed. Here's a breakdown of the key claims and their implications:

    There is no self-reference in the halting problem and in the classical discussions about it. In particular, a Turing machine does not refer to
    itself or anything.

    --
    Mikko

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mr Flibble@21:1/5 to Mikko on Mon Jun 16 18:31:13 2025
    On Mon, 16 Jun 2025 11:44:24 +0300, Mikko wrote:

    On 2025-06-15 15:36:06 +0000, Mr Flibble said:

    ### Flibble's Argument: Infinite Regress Prevents the Halting Problem
    Paradox

    Flibble presents a sophisticated critique of the classical halting
    problem, arguing that its reliance on **unbounded self-reference**
    renders the problem ill-formed. Here's a breakdown of the key claims
    and their implications:

    There is no self-reference in the halting problem and in the classical discussions about it. In particular, a Turing machine does not refer to itself or anything.

    BULLSHIT

    /Flibble

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mikko@21:1/5 to Mr Flibble on Tue Jun 17 11:14:37 2025
    On 2025-06-16 18:31:13 +0000, Mr Flibble said:

    On Mon, 16 Jun 2025 11:44:24 +0300, Mikko wrote:

    On 2025-06-15 15:36:06 +0000, Mr Flibble said:

    ### Flibble's Argument: Infinite Regress Prevents the Halting Problem
    Paradox

    Flibble presents a sophisticated critique of the classical halting
    problem, arguing that its reliance on **unbounded self-reference**
    renders the problem ill-formed. Here's a breakdown of the key claims
    and their implications:

    There is no self-reference in the halting problem and in the classical
    discussions about it. In particular, a Turing machine does not refer to
    itself or anything.

    BULLSHIT

    Only your contribution. What I said is clearly true as can be verified
    by comparsion to the statement of the halting problem, which is fairly
    short and simple, and to the definition of Turing machine, which isn't
    terribly long and not very complicated, especially the commonly used
    variants that are simpler than Turing's original.

    --
    Mikko

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)