In this article, I review two recent developments in the theory of computation of general equilibria. First, following Brown, DeMarzo and Eaves (1996) several papers have developed globally convergent algorithms for the computation of general equilibria in models with incomplete asset markets. I review some of the developments in that area. Second, new developments in computational algebraic geometry lead to algorithms to compute effectively all equilibria of systems of polynomial equations. I point out some applications of these algorithms to general equilibrium theory.