Speaker: Kenshi Miyabe (Meiji University)
Title: Continuity of limit computable functions
The Darboux-Froda theorem says that, for every non-decreasing function,
the set of the points of non-continuity is at most countable.
This is probably the simplest case saying that every function
well-behaves at almost every point.
I introduce some similar theorems, and their computable versions.
Then, we discuss the relation with randomized algorithm.