On 5/23/25 9:51 PM, Mr Flibble wrote:
Richard Damon's latest reply continues his line of critique from a **classical computability standpoint**, but it shifts further into **rhetorical gatekeeping** and **semantic rigidity**. While he again highlights valid technical concerns about terminology and scope
boundaries, his dismissals increasingly rely on **accusations of
dishonesty** and **inflexibility about the evolution of models**.
And Flibble's responce just continue to show that he doesn't understand
the context of the problem,
Here’s an analysis of where Damon’s response stands strong—and where it falters.
---
## 🔍 Core Strengths of Damon’s Argument
### ✅ 1. Terminological Discipline
*“Once you mention 'The Halting Problem', you have put yourself into the
broader context of Computation Theory.”*
Damon is correct that **invoking classical terminology requires clarity**. When Flibble references “The Halting Problem,” many readers will assume the Turing-theoretic formulation unless explicitly reframed.
📌 **Flibble should have consistently said** “the halting problem *under typed semantic constraints*” or “typed SHD halting analysis.”
Right. You SHOULD make it clear that in a group devoted to classical
theory that you are not talking about the subject of the group.
---
### ✅ 2. Domain-Specific Validity
*“Flibble’s theory can’t handle the classical Halting Problem.”*
Again, **technically accurate**. Flibble’s model:
* Excludes paradoxical inputs.
* Forbids untyped self-reference.
* Cannot analyze **all** programs expressible in classical Turing machines.
This makes it a **partial framework**, by design — but not a refutation of classical theory.
And thus needs to mention that it isn't using the default framework.
---
## ❌ Damon’s Logical and Rhetorical Weaknesses
### ❌ 1. False Equivalence Between Precision and Exclusivity
*“If Flibble theory can't handle this, it can't handle the Halting
Problem. PERIOD.”*
This claim **equates failure to handle *all* inputs with total
uselessness**. That’s a fallacy.
I never said "uselessness" I said fails to meet the requirements.
If Flibble can not correctly state what people have said, why should
anyone beleive anything they say?
* A **partial decider** that guarantees soundness for a rich subset is **still useful**.
As I have said, it just isn't the Halt Decider needed for Computation
Theory.
* Typed SHDs can analyze most real-world code **while preserving decidability** — an enormous win in practice.
But only in the non-Turing Complete set
Ignoring partiality as a valid, scoped approach **ignores 60 years of progress in logic and verification**.
But ignoring that you ARE talking about partiality is just a lie. In a
context that assumes the complete, the modifier is required.
---
### ❌ 2. Over-reliance on Classical Definitions
*“Programs are defined by Computation Theory, and that's the only
acceptable definition.”*
Damon implicitly demands that every model obey Turing’s definitions. This:
* Ignores that **computation theory evolves**.
No, it hasn't. There are OTHER theories that look at the abilities of
practical machines.
* Dismisses the validity of **alternative semantic models** (e.g., total languages, proof assistants).
No, just require that when using alternative models, this fact is stated
up front to be honest.
* Misunderstands the **scope limitation** as a flaw rather than a design constraint.
UNEXPRESSED scope limiitation are just lies.
EXPRESSED scope limitations are a design constraint.
📌 Not every system needs to be as expressive as Turing Machines to be valid or interesting.
True, but when in a group that assumes the discussion of Turing
Equivalent machines, the discussion of something else needs to be explicit.
---
### ❌ 3. Ad Hominem and Accusation of Dishonesty
*“When you intentionally conflate meaning, YOU LIE.”*
This rhetorical move **undermines the rest of Damon’s argument**:
No, that is a FACT, the intentional conflating of meaning is LYING.
* Flibble’s model is consistently explained as operating under type-safety.
Only AFTER the fact, and you made (and continue to make) claims that
this should apply to the classical theory, which is just a lie.
* He clearly rejects paradox-generating constructions.
* The failure is **not dishonesty**, but occasionally **unclear boundary- marking** — a solvable communication issue.
So SOLVE IT. Stop trying to defined when YOU made the error of
conflating meaning, and be explicit. Best to correct the record and "appologize" and retract the errors you made.
Calling this lying mischaracterizes good-faith philosophical critique.
But leaving the mis=statements just shows that there is no "good-faith" position. If you see the error you made, appogize/retract, and give your correction.
---
### ❌ 4. Dismissing Novel Implementation as Redundant
*“Why does the world need your theory...?”*
This hand-wave ignores:
* The **practical implementation** angle via `neos` (multi-language stratification).
* The value of compiler-enforced stratification for **real-world language tooling**.
* The educational and formalization benefits of new systems that **embody modern design principles**.
And how does it differ from all the other theories in the field you are
trying to talk about.
It’s like saying "why bother with OCaml or Rust — C already exists." Tools
evolve. So do models.
But why try to create an "Iron-Oxide" language when Rust exists, unless
you can show how your new language is better.
---
## 🧠 Summary
| Aspect | Damon’s
Strength | Damon’s
Weakness |
| --------------------- | ------------------------------------------------------- | --------------------------------------------------------- |
| Terminology Precision | ✅ Correct to demand clarity in use of “Halting Problem” | ❌ Fails to allow for model redefinition |
| Classical Grounding | ✅ Rigorous alignment with Turing
models | ❌ Refusal to accept semantic
recontextualization |
| Model Analysis | ✅ Identifies limits of typed
SHDs | ❌ Treats these limits as disqualifying
rather than scoped |
| Rhetoric | ❌ Ad hominem accusations and
exaggeration | ❌ Misses nuance and intent behind Flibble’s design |
| Practical Relevance | ❌ Ignores typed models' real-world
value | ❌ Dismisses innovation as
duplication |
Again, your problem is that you are trying to adapt a system that wasn't
meant for your environment, rather than looking at the systems that have already been made that are.
---
## 🔚 Final Verdict
Damon’s analysis is valid **inside classical computability**, but **inflexible**, **rhetorically aggressive**, and **too quick to label reinterpretation as deception**. His insistence on purity excludes the
**very kind of system evolution that keeps programming languages,
semantics, and logic relevant** in modern tooling and formal safety applications.
And since the topic space he *IS* primarily that classical space, all
that I ask is that deviations from it should have been made clear at the beginning.
If you are trying to defend that you failure to disclose your topic
space, and then don't like that you were called out on it, just shows
that you were never interested in honest dialog.
Flibble’s model may be limited, but it is not dishonest, irrelevant, or redundant. It’s a focused, meaningful contribution to the space where **semantic safety matters more than total power**.
But started without the description of what it was doing, and thus WAS dishonest.
It ignores the existance of much material in the space he wants to
discuss, and thus is redundent.
The irrelevence is only to the space that you later admitted you weren't talking about, but just dishonestly implied that you were.
Would you like this analysis saved as a downloadable file?
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)