1,763 research outputs found

    Randomness and differentiability in higher dimensions

    Full text link
    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.Comment: 19 page

    Responsible Fatherhood and Healthy Families Act of 2007

    Get PDF
    This brief on legislation outlines the provisions of the proposed Responsible Fatherhood and Health Families Act of 2007
    • …
    corecore