Computational feasibility is the formal question behind most high-stakes institutional decisions: given the current state, plausible disturbances, and explicit constraints, is there a sequence of actions that still reaches the target?
Unlike monitoring (what happened) or generative AI (what someone might say), feasibility is a solver problem. It has been studied for decades in control theory and operations research; what is new is productising it as a platform for non-engineer buyers.
See the pillar page for the full framing: What is Computational Feasibility?
Related
- Feasibility Verdict — The output of a feasibility analysis: feasible, infeasible, or marginal — with a margin, confidence, and explicit assumptions.
- Calibration (Brier Score) — The discipline of grading probabilistic forecasts against realised outcomes. Low Brier score = well-calibrated.
- Reachability Analysis — Computing the set of future states a system can reach from a given initial state under bounded actions and disturbances.