foundational principle in theoretical computer science

A foundational principle in theoretical computer science is a core, abstract concept or rule—such as computability, complexity, or formal language theory—that underlies and unifies the study of algorithms, computation models, and their inherent limits.

Instances (1)

• Church–Turing thesis