In Fall 2012 I will teach a graduate course on infinitary computability theory in the Computer Science program at the CUNY Graduate Center. This course will be aimed at graduate students in computer science and mathematics who are interested in infinitary computational processes.
Infinitary computability, CSC 85020, Mondays, 9:30 – 11:30 am
CS course listings | this listing
This course will explore all the various infinitary theories of computability, including infinite time Turing machines, Blum-Shub-Smale computability, Büchi automata, ordinal register machines and others. The focus will be on introducing the computability models and comparing them to each other and to standard concepts of computability. In the early part of the course, we shall review the standard finitary computational models, before investigating the infinitary supertask analogues.
Students wishing to prepare for the course should review their understanding of Turing machines and the other theoretical machine models of computation.
Some of my articles on infinitary computability | Student talks on their infinitary computability term papers
Pingback: Leibniz to read; infinitary computability « chorasimilarity
Pingback: Student talks on infinitary computability | Joel David Hamkins
Bucci automata =>Büchi automata
Thanks! I have corrected.