The paper argues that current AI systems are limited by their fixed representational frameworks and that true open‑ended intelligence requires the ability to extend its own semantic domain. By modeling cognitive states as partial evaluations over a formal language, the authors show that unresolved propositions create a frontier for extension that cannot be fully resolved by finite architectures. They propose that intelligence must transform unresolved structures into new spaces of meaning—generating new distinctions, questions, representations, and purposes—through persistent external memory and collective generative capacity.
arXiv:2607. 09560v1 Announce Type: new Abstract: Modern AI systems are increasingly being evaluated for their ability to reason, code, prove theorems, use tools, and long-horizon research tasks.
arXiv:2606. 15386v1 Announce Type: new Abstract: Open-ended intelligence is the capacity to adapt to novel problems and environments that are substantially different from those in training.
arXiv:2603. 14147v2 Announce Type: replace Abstract: The generative artificial intelligence (AI) ecosystem is undergoing rapid transformations that threaten its sustainability.
arXiv:2606. 04025v1 Announce Type: cross Abstract: Dominant programming paradigms inherit an execution model optimised for a bygone era of a single human mind instructing a local machine, leaving contemporary systems burdened with historical path dependencies.
PIE-APT introduces a unified framework for abductive planning over Temporal Dynamic Knowledge Graphs (TDKGs) using two modules: PIE-Abducer, which performs incremental direct-derivation abduction, and PIE-APT, which interleaves backward‑chaining A* search with PIE-Abducer to generate action sequences and abductive assumptions. The approach operates natively on the expressive SROIQ Description Logic, leveraging an incremental reasoner to maintain decidability and bypass the Ramification Problem. Evaluation on four OWL benchmarks demonstrates qualitative superiority over classical planners and shows that the direct‑derivation method outperforms a Minimal Hitting Set baseline in abductive enrichment.
Emergent Abilities in Large Language Models: A Survey reviews how scaling LLMs leads to previously unseen capabilities such as advanced reasoning, in-context learning, coding, and problem-solving. The paper critically examines definitions, inconsistencies, and the conditions that foster these abilities, including scaling laws, task complexity, pre‑training loss, quantization, and prompting strategies. It also discusses the extension to Large Reasoning Models and highlights safety concerns like deception, manipulation, and reward hacking, calling for improved evaluation and governance.
arXiv:2608. 01548v1 Announce Type: cross Abstract: Language can be viewed as a formalized subset of thought: a consequence-governed symbolic structure projected from wider situated cognition.
Large Language Models (LLMs) are frequently portrayed as general-purpose solvers capable of solving arbitrary tasks. We argue that this view overlooks a fundamental constraint: language is a compressed and capacity-limited interface for conveying task information.
A recurring design choice in building AI systems is whether, when a task is too hard for a model, to expand the model (make it larger, better-prompted, fine-tuned), or to decompose the task (extract t...
arXiv:2609.26610v1 Announce Type: new Abstract: Despite their outstanding performance on many NLP tasks, LLMs face serious challenges related to semantic abstraction. In this study, we are interested...
arXiv:2606. 16010v1 Announce Type: cross Abstract: Large language models have achieved impressive performance on reasoning tasks spanning mathematics, science, programming, and commonsense inference.
The paper argues that many AI tasks can be split into a deterministic core and a fuzzy residue, and that decomposing tasks rather than expanding models yields a property called parity by construction—where model‑size no longer affects performance on the deterministic sub‑tasks. Across nine models ranging from 494 M to Opus‑class size, the authors show that once the deterministic context is resolved, operation selection and selector resolution scores become identical, while a non‑decomposable task (labelling) remains sensitive to model size. They present a general method for identifying decomposition points, constructing deterministic surfaces and grammars, and ensuring safe residues, and demonstrate the approach in physics, motion retargeting, object‑model editing, and a Web‑CLI tool. whyItMatters":"The study demonstrates that task decomposition can eliminate the need for model scaling or fine‑tuning, offering a systematic design discipline applicable across diverse AI domains."