Computable randomness and monotonicity
Abstract
We show that z∈n is computably random if and only if every computable monotone function on n is differentiable at z.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.