To All,
My colleague Prof. Steffen Lempp (of Math) will offer Math 873 next semester.
Prof. Lempp is a world authority in recursion theory (computability theory).
The course will be on computable linear and partial orderings, it’s an old topic with a long history,
and there are still some pretty easy problems around, according to Prof. Lempp.
He thinks there may be even automata versions of questions around that would be more
along the lines of CS topics.
I highly recommend students having an interest in these topics consider
taking this class (which may not be offered again any time soon.)
Jin-Yi