The access management system was updated on 31st March. If you experience any difficulty logging in, please try resetting your password. If the issue persists, please contact support at [email protected]
Emil Post was a pioneer in the theory of computation, which investigates the solution of problems by algorithmic methods. An algorithmic method is a finite set of precisely defined elementary directions for solving a problem in a finite number of steps. More specifically, Post was interested in the existence of algorithmic decision procedures that eventually give a yes or no answer to a problem. For instance, in his dissertation, Post introduced the truth-table method for deciding whether or not a formula of propositional logic is a tautology.
Post developed a notion of ‘canonical systems’ which was intended to encompass any algorithmic procedure for symbol manipulation. Using this notion, Post partially anticipated, in unpublished work, the results of Gödel, Church and Turing in the 1930s. This showed that many problems in logic and mathematics are algorithmically unsolvable. Post’s ideas influenced later research in logic, computer theory, formal language theory and other areas.