Randomness and differentiability in higher dimensions
From MaRDI portal
Abstract: We present two theorems concerned with algorithmic randomness and differentiability of functions of several variables. Firstly, we prove an effective form of the Rademacher's Theorem: we show that computable randomness implies differentiability of computable Lipschitz functions of several variables. Secondly, we show that weak 2-randomness is equivalent to differentiability of computable a.e. differentiable functions of several variables.
This page was built for publication: Randomness and differentiability in higher dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6255969)
