Computability and the Universal Machine

In 1936 Turing described simple abstract machines that execute symbol-processing rules and showed how one universal machine could simulate others. The model clarified both the reach and the limits of effective computation.