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 concept of a "Universal Machine" (now known as a universal Turing machine) was included in this idea, which proposed that such a machine could perform any other computation task.  Church's lambda calculus was also mentioned, suggesting it too could achieve the same capabilities. The Church–Turing thesis states that Turing machines and lambda calculus can compute anything computable.