> It's a big controversy in CS education, isn't it? Is it? I think most people who have heard of the topic are familiar with the Church-Turing thesis and know

> It's a big controversy in CS education, isn't it? Is it? I think most people who have heard of the topic are familiar with the Church-Turing thesis and know that both definitions of effective calculability are equivalent. My preference is mostly a matter of taste I think. I admire how little there is to the lambda calculus definition and how computability somehow emerges through construction and definition (which admittedly are not simple). It nicely shows that you need very little "machinery" to get a powerful computational system. Turing machines by comparaison seem somewhat contrieved with their infinite tape, head and register even if I realise that in a lot of way they are closer to an actual computer.