The Non-Locality of Extendability: An Impossibility Theorem for Bounded Information Systems, with Applications to Generative Sequential Systems

Indexed indatacite

Abstract

Forward-case specialization of the Projection Insufficiency Theorem (PIT) for generative sequential systems. Introduces the Non-Observability of Extendability (NEO) theorem and the explicit adversarial divergence-kernel construction — the arithmetic-witness machinery on which the remainder of the program's policy-level impossibility arguments build. Abstract Generative sequential systems — language models, planning agents, and reinforcement learning policies — construct trajectories step by step. At each step, an action is selected based on locally available information, under the implicit assumption that locally valid choices can be assembled into globally valid outcomes. In environments governed by non-local…

Citation impact

8
total citations
FWCI
Percentile
References
0
Too recent for citation history.

Authors

1

Topics & keywords

Keywords
  • Bounded function
  • Corollary
  • Constraint (computer-aided design)
  • Projection (relational algebra)
  • Reinforcement learning
  • Function (biology)
  • Consistency (knowledge bases)
  • Incentive compatibility
No related works found for this paper.