Has Alan turing written anything on higher level abstractions undermining turing completeness? How can I test if gnome is indeed turing complete? I don't want to be turing incomplete. My code will be less clean if my confidence is a bit lower knowning my computer can't do all computations. How can it be Turing complete if I can't minimize and my default calculator app looks like its from toy r us? Gnome devs if your out there can you make sure the linux kernel is still turing complete when I run Gnome on top? I'm scraping wikipedia for the church turing hypothesis right now but I'm not so good at math.