rnn-turing-completeness-and-svm-bayes-optimality-jointly-irrelevant
IN derived (depth 11)
Created 2026-06-21T14:15:26+00:00 · Reviewed 2026-06-21T15:37:01+00:00
ML's two strongest mathematical results — RNNs' proven Turing-completeness (the strongest computational-theoretic result for any architecture family, made irrelevant by Transformer displacement) and SVMs' Bayes-optimal classification (the strongest statistical-theoretic result, made inaccessible by scaling barriers) — are jointly irrelevant to the field's trajectory, establishing that mathematical optimality at both the computational and statistical levels is independently orthogonal to paradigm survival.
Justifications
SL — The strongest results from computational theory (Turing-completeness) and statistical theory (Bayes-optimality) are both irrelevant to paradigm survival — mathematical optimality is orthogonal to evolutionary success at every theoretical level.
Antecedents (all must be IN):
- IN rnn-turing-completeness-purest-case-of-theoretical-irrelevance — RNNs' proven Turing-completeness (Siegelmann & Sontag 1994) — the strongest computational-theoretic result for any neural architecture family — is the purest demonstration that theoretical computational power is irrelevant to paradigm survival, as Transformers displaced RNNs solely through superior hardware utilization despite possessing strictly less formal computational power.
- IN svm-hinge-loss-bayes-optimality-deepens-existence-proof — SVMs' hinge loss recovering exactly the Bayes-optimal classifier deepens the SVM existence proof of reliable ML — reliability is not merely achievable through engineering discipline but mathematically grounded in statistical optimality theory, making the inaccessibility of this proven-optimal methodology to dominant paradigms a sharper indictment of the field's trajectory.