This paper introduces the Infinite Choice Barrier — a formal, structural argument for why AGI, as traditionally conceived, is not just hard but provably impossible.

It outlines three theorems: • Semantic Closure • Non-Computability of Frame Innovation • Statistical Breakdown in Open-World Contexts

Includes formal proofs, historical analogies (Newton → Einstein), and implications for modern AI architectures.

Full paper: https://philpapers.org/rec/SCHTAB-13

Curious to hear pushback or counterexamples from this community.