In this session, we move beyond basic prompting to understand the mathematical engine of reasoning. We explore how Chain of Thought (CoT) transforms Large Language Models from simple lookup tables into sequential reasoning engines by leveraging the transformer's context window as an externalized working memory.
1. From Direct Mapping to Sequential Probability
In standard prompting, the model calculates the probability of an answer based solely on the questionβ$P(Answer | Question)$. For complex logic, this single "jump" is often too large. Chain of Thought breaks this down into a sequence: $P(y | x, z_1, z_2, \dots, z_n)$, where each $z$ is an intermediate reasoning step that constrains the model toward a more accurate conclusion.
2. Logical Transparency and Compute
CoT is essentially a method of "slowing down" the model. By forcing the generation of intermediate tokens, we compel the model to allocate more computational cycles to a problem. This creates a "verifiable trace," turning the model's internal processing into a visible path that can be audited, corrected, and structured.
You must define a specific structure in the prompt, such as "Identify Constants -> Define Variables -> Perform Operations -> State Result," which forces the model to externalize each dependency before the final prediction.