Masako Washihara

Learn More
We will speculate on some aspects of computability of the system of Rademacher functions, a system of step functions on the compact interval [0; 1), jumping at nitely many binary rationals and assuming values f1; 01g. Knowledge in the notion of computability of a real number or a sequence of real numbers will be assumed. (A real number is computable if it(More)
The major objective of this article is a refinement of treatments of the mutual relationship between two notions of " sequential computability " of a function which is possibly Euclidean-discontinuous, one using limiting recursion and one using effective uniformity. We also speculate on these methods from a mathematician's viewpoint.
  • 1