Title: Computability of Agentic Systems
Primary area: foundation or frontier models, including LLMs
Keywords: Computability, Hierarchy reasoning, Graph of thoughts

Abstract: This paper introduces the Quest Graph, a formal framework for analyzing the computational power of deterministic agentic systems with finite context. 
	We define key variants that model common reasoning techniques: 
	the forward-only Quest Decision Process (QDP) for hierarchical reasoning, 
	and the Reference-Augmented QDP (RQDP) for memory retrieval. 
	Theoretically, we demonstrate that these models form a hierarchy of computational power corresponding to key levels of the formal language hierarchy.
	We then analyze the practical efficiency of each model by simulating task dependencies in computation graphs,
	revealing that this theoretical hierarchy translates to significant performance trade-offs. 
	This work provides a formal methodology for classifying and understanding the fundamental capabilities of agentic systems.

TL;DR: This paper establishes a formal link between agentic system design and the formal language hierarchy, and analyzes the practical efficiency of these designs in simulating computation graphs.