Alan Turing was in the news just now. On 24 Dec. the Queen issued a pardon for him. (This is only formally the Queen, and not of her own initiative, it is an act of the government. The term 'Pardon' could be misunderstood and us legalistic/anachronistic, according to wiki it these days constitutes a recognition that a conviction was morally wrong.) I think the story is well known. My question is: are Turing's Theorem and Godel's the same thing? They sound like it to me. Godel's is about a 'formal system' which turns strings of symbols into other strings, a Turing machine just sounds like a way of realising such a thing. There would be some problems for which neither would ever get to the end. In fact wouldn't they be the same problems? I've read articles and books about GT and Turing, remember a few concepts but never grasped them that well that I could give much of an account of the argument that gives the conclusions. If I wait till I can read them again this will have lost topicality.