# topic/cs/theory

Big-O and Complexity Analysis

Big-O notation describes how an algorithm's time or space scales with input size , ignoring constants and lower-order terms.

Computational Complexity of Attention

Standard Self-Attention has time and memory in sequence length . This is the fundamental bottleneck of transformers.

Computer Science Foundations

Computer science foundations study the cost and structure of computation. The useful mental model is: algorithms transform inputs into outputs, data structures control access…

P vs NP and Intractability

P = problems solvable in polynomial time. NP = problems whose solutions are verifiable in polynomial time. The question is open, but widely believed to be .