Domain 09 · Mathematics Codex

Applied & Computational Mathematics

Mathematics in service of the world — numerical methods, optimisation, and the mathematical foundations of computation.

Scope

Numerical analysis, optimisation theory, mathematical foundations of machine learning and AI, complexity theory, computational mathematics, operations research, mathematical finance.

Every scientific simulation, every trained neural network, every efficient logistics algorithm draws from applied mathematics. The question of whether P equals NP — whether problems that are easy to check are also easy to solve — is a Clay Millennium Prize problem that touches the limits of computation itself.

Entries in this domain

Build status: This domain is in active build. Live entries are marked below. All other entries are planned and pending — see build status for the full picture.
  • Gradient Descent Pending
    An iterative optimisation algorithm that moves in the direction of steepest decrease of a function — the engine of modern machine learning.
  • NP-Completeness Pending
    A class of computational problems for which no efficient algorithm is known — and for which finding one (or proving none exists) would resolve the most important open problem in computer science.

All 14 domains

← Back to Mathematics Codex