Chapter 16. Intuitionistic Logic
Constructive semantics, proof interpretation, differences from classical logic, Kripke models, and applications in computation.
Tag
Computation
14 notes
13.5 Proof Length and Complexity
Quantitative study of proofs, including proof size, efficiency, and connections to computational complexity.
11.3 Universal Machines
Machines that simulate any other Turing machine, establishing the concept of programmable computation.
11.2 Computation Traces
Step-by-step evolution of Turing machine configurations and how computations are represented as traces.
11.1 Machine Definitions
Formal definition of Turing machines, including states, tape, alphabets, and transition functions.
Chapter 10. Computable Functions
Recursive functions, partial and total functions, the Church-Turing thesis, formal models of computation, and equivalence of models.
9.5 Reproducibility and Verification
How to make computational results repeatable, checkable, and trustworthy.
9.4 Symbolic vs Numeric Methods
Understanding the difference between manipulating exact mathematical expressions and computing with numerical values.
9.3 Exact vs Approximate Computation
When to compute exact results and when to use approximations.
9.2 Complexity Awareness
Understanding how the cost of an algorithm grows with input size.
9.1 Algorithmic Thinking
How to think step by step and turn mathematical ideas into clear procedures.
Chapter 9. Computation and Algorithms
Overview of algorithmic thinking, computational methods, complexity, approximation, and verification in mathematics.
5.1 Concrete Computation
Working with explicit examples, calculations, and finite procedures as the base level of mathematical reasoning.
65. Numerical Analysis
This volume studies algorithms for approximating mathematical problems.