[S2] _________________________ AMAST Links 02 03

Gathering Information about Teaching in Computable Analysis

by Klaus Weihrauch <Klaus.Weihrauch@fernuni-hagen.de>

While discrete computability and complexity theory is one of the main disciplines in theoretical computer science, seemingly computer scientists have neglected computability and complexity in analysis in research and especially in teaching.

I would like to gather information about the present situaton in teaching.

If you do teach effective analysis in your courses, please, send me some information, e.g. about the following:

• undergraduate or graduate course?
• as a part of a course on computability, complexity or calculus / analysis, as a tool in some other course, as a separate course?
• which model? (algebaic, intuitionistic, Bishop, Russian, Polish, Pour-El and Richards, real RAM, BSS, IBC, Ko and Friedman, "bit-complexity", ...)
• main topics?
• further comments.

I shall mail the answers (in condensed form, if there should be too many) to THEORYNT.