No Universal Hyperbola: A Formal Disproof of the Epistemic Trade-Off Between Certainty and Scope in Symbolic and Generative AI

• URL: http://arxiv.org/abs/2601.08845v1
• Date: Sun, 21 Dec 2025 20:04:40 GMT
• Title: No Universal Hyperbola: A Formal Disproof of the Epistemic Trade-Off Between Certainty and Scope in Symbolic and Generative AI
• Authors: Generoso Immediato,
• Abstract summary: We disprove a conjectured artificial intelligence trade-off between certainty and scope in the universal hyperbolic product form.<n>We show, first, that when the conjecture is instantiated with prefix (self-delimiting, prefix-free) Kolmogorov complexity, it leads to an internal inconsistency, and second, that when it is instantiated with plain Kolmogorov complexity, it is refuted by a constructive counterexample.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We formally disprove a recently conjectured artificial intelligence trade-off between epistemic certainty and scope in the universal hyperbolic product form in which it was published. Certainty is defined as the worst-case correctness probability over the input space, and scope as the sum of the Kolmogorov complexities of the input and output sets. Using standard facts from coding theory and algorithmic information theory, we show, first, that when the conjecture is instantiated with prefix (self-delimiting, prefix-free) Kolmogorov complexity, it leads to an internal inconsistency, and second, that when it is instantiated with plain Kolmogorov complexity, it is refuted by a constructive counterexample. These results establish a general theorem: contrary to the conjecture's claim, no universal "certainty-scope" hyperbola holds as a general bound under the published definitions.

Related papers

• Tame Complexity of Effective Field Theories in the Quantum Gravity Landscape [0.0]
  We show that effective field theories obey surprising finiteness constraints, appearing in several distinct but interconnected forms.<n>We propose a framework that unifies these observations by proposing that the defining data of such theories admit descriptions with a uniform bound on complexity.<n>This work also yields mathematically well-defined notions of counting and volume measures on the space of effective theories.
  arXiv  Detail & Related papers  (2026-01-26T19:00:00Z)
• Measurement as Sheafification: Context, Logic, and Truth after Quantum Mechanics [0.0]
  I argue that quantum theory is inherently contextual, whereas the classical tradition presupposes a single global, Boolean valuation.<n>I recast locality and completeness as the existence of a global section of a presheaf of value assignments over the category of measurement contexts.
  arXiv  Detail & Related papers  (2025-12-13T09:15:20Z)
• On the Complexity of the Grounded Semantics for Infinite Argumentation Frameworks [0.0]
  We use methods from mathematical logic, specifically computability and set theory, to analyze the grounded extension.<n>Finding this fixed-point requires transfinite iterations.<n>This shows a marked distinction from the finite case where the grounded extension is-time computable.
  arXiv  Detail & Related papers  (2025-11-27T12:13:30Z)
• Error exponents of quantum state discrimination with composite correlated hypotheses [40.82628972269358]
  We study the error exponents in quantum hypothesis testing between two sets of quantum states.<n>We introduce and compare two natural extensions of the quantum Hoeffding divergence and anti-divergence to sets of quantum states.
  arXiv  Detail & Related papers  (2025-08-18T13:04:06Z)
• Comment on "Unifying Aspects of Generalized Calculus" [0.0]
  Czachor's recent proposal introduces a form of non-Newtonian calculus.<n>It runs into serious conceptual trouble when examined from a physical standpoint.
  arXiv  Detail & Related papers  (2025-08-08T15:23:21Z)
• The complexity of entanglement embezzlement [0.0]
  We study the circuit complexity of embezzlement using sequences of states that enable arbitrary precision for the process.<n>We imply that circuit complexity acts as a physical obstruction to perfect embezzlement.
  arXiv  Detail & Related papers  (2024-10-24T18:00:33Z)
• Generalization Guarantees via Algorithm-dependent Rademacher Complexity [33.408679482592426]
  We propose a measure to control generalization error, which is the empirical Rademacher complexity of an algorithm- and data-dependent hypothesis class. We obtain novel bounds based on the finite fractal dimension, which (a) extend previous fractal-type bounds from continuous to finite hypothesis classes, and (b) avoid a mutual information term.
  arXiv  Detail & Related papers  (2023-07-04T18:37:38Z)
• A Measure-Theoretic Axiomatisation of Causality [55.6970314129444]
  We argue in favour of taking Kolmogorov's measure-theoretic axiomatisation of probability as the starting point towards an axiomatisation of causality. Our proposed framework is rigorously grounded in measure theory, but it also sheds light on long-standing limitations of existing frameworks.
  arXiv  Detail & Related papers  (2023-05-19T13:15:48Z)
• Neuro-Symbolic Entropy Regularization [78.16196949641079]
  In structured prediction, the goal is to jointly predict many output variables that together encode a structured object. One approach -- entropy regularization -- posits that decision boundaries should lie in low-probability regions. We propose a loss, neuro-symbolic entropy regularization, that encourages the model to confidently predict a valid object.
  arXiv  Detail & Related papers  (2022-01-25T06:23:10Z)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)
• Entanglement and Complexity of Purification in (1+1)-dimensional free Conformal Field Theories [55.53519491066413]
  We find pure states in an enlarged Hilbert space that encode the mixed state of a quantum field theory as a partial trace. We analyze these quantities for two intervals in the vacuum of free bosonic and Ising conformal field theories.
  arXiv  Detail & Related papers  (2020-09-24T18:00:13Z)
• Adversarial Learning Guarantees for Linear Hypotheses and Neural Networks [45.06091849856641]
  We give upper and lower bounds for the adversarial empirical Rademacher complexity of linear hypotheses. We extend our analysis to provide Rademacher complexity lower and upper bounds for a single ReLU unit. Finally, we give adversarial Rademacher complexity bounds for feed-forward neural networks with one hidden layer.
  arXiv  Detail & Related papers  (2020-04-28T15:55:16Z)
• Quantum Geometric Confinement and Dynamical Transmission in Grushin Cylinder [68.8204255655161]
  We classify the self-adjoint realisations of the Laplace-Beltrami operator minimally defined on an infinite cylinder. We retrieve those distinguished extensions previously identified in the recent literature, namely the most confining and the most transmitting.
  arXiv  Detail & Related papers  (2020-03-16T11:37:23Z)
• Generalised Lipschitz Regularisation Equals Distributional Robustness [47.44261811369141]
  We give a very general equality result regarding the relationship between distributional robustness and regularisation. We show a new result explicating the connection between adversarial learning and distributional robustness.
  arXiv  Detail & Related papers  (2020-02-11T04:19:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.