Thoughts
Computational Capabilities of Large Language Models: the Universal Approximation Theorem
Introduction The emergence of Large Language Models (LLMs) has prompted fundamental questions about their computational capabilities within the theoretical landscape of computer science. While these models demonstrate remarkable linguistic abilities, their precise classification within the hierarchy of computational systems remains an area of active exploration. Simultaneously, the Universal Approximation Theorem