# Complexity Theory Computational complexity theory is the branch of computer science that is concerned with what resources (such as time, memory capacity or energy) are required to perform given classes of computations. The complexity of a piece of information is defined in terms of the computational resources (such as the length of the program, the number of computational steps or the amount of memory) that a computer would need if it was to reproduce that piece of information. Several different definitions of complexity are in use, each with its own domain of applicability. The exact definitions need not concern us here, but they are all based on the idea that a complex process is one that in effect presents us with the results of a substantial computation. --- Date: 20241113 Links to: [Fabric of Reality](Fabric%20of%20Reality.md) pg 92 Tags: References: * []()