Positively churbling. Happy from computability
Maverick Tom Forster set a great exam today, with a nice Ackermann question, Y-combinators, and non-decidability of the set of gnumbers of machines with given function graphs. For about one and a half days’ work in total, ever, the lowest of any of the courses, that one came out well. He’s the kind of guy who might have thought it fun to set some of PTJ’s “challenging excercises”. I’ve actually already done the revision for Graphs on Monday, so I just have to start Set Theory for Tuesday; plenty of time, so I’m tempted to have half the evening off. (Tosca came in the post today! Score.)