It also included a notion of a 'Universal Machine' (now known as a universal Turing machine), with the idea that such a machine could perform the tasks of any other computation machine (as indeed could Church's lambda calculus). According to the Church–Turing thesis, Turing machines and the lambda calculus are capable of computing anything that is computable.
The "Universal Machine" (now known as a universal Turing machine) is proposed to be capable of performing any other computation task, similar to what Church's lambda calculus can do. The Church–Turing thesis states that both Turing machines and lambda calculus are capable of computing anything computable.