6 June 2007, Presentations on "Advanced Topics in Recursion Theory"

The participants of Joel Hamkins' course "Advanced Topics in Recursion Theory" will be presenting their results on various interesting topics involving computability theory. There will be five short student presentations. All ILLC members and students are cordially invited.

Speakers:
Ansten Morch Klev, "Infinite time Turing machine analogue of Kleene's O"
Thomas Icard III, "Computable Completeness and Omitting Types Theorems"
Huanfang Dong, "Computable trees"
Chris Regenboog, "The Countable Random Graph"
Wouter Koolen-Wijkstra, "The IQ of primitive recursion"