Computation Theory
The study of what can be computed, how efficiently, and what cannot be computed at all.
Why it matters now
Some problems are formally hard: optimal reserve design, grid dispatch, and supply chain allocation are all in classes where exact answers are out of reach at scale. Knowing this is liberating rather than defeating, because it directs effort toward good approximations, which are usually available and usually sufficient.
Where this is happening on Earth
- EuropeAlan Turing, Cambridge and Bletchley Park, EnglandDefined computation and its limits, and proved that some questions have no algorithm.
- North AmericaReserve selection as a set cover problemConservation planning shown to be computationally hard, which is why heuristic tools like Marxan are used worldwide.
- AsiaGrid unit commitment at national scale in China and IndiaDispatch problems solved by approximation many times each day.
- OceaniaMarxan conservation planning software, University of Queensland, AustraliaA practical heuristic now used for marine and terrestrial planning on every continent.
- AfricaMini-grid siting optimisation across Sub-Saharan AfricaHard combinatorial problems handled with approximations good enough to electrify villages.
The idea itself
The encyclopedia entry first, then live searches at journals and magazines that keep returning current work on this specific idea.
Current reporting from around the world
Standing feeds at reputable periodicals. These stay fresh on their own, which is why they are here instead of a list of articles that would be out of date within a season.