eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2014-03-05
602
613
10.4230/LIPIcs.STACS.2014.602
article
Differentiability of polynomial time computable functions
Nies, André
We show that a real z is polynomial time random if and only if each nondecreasing polynomial time computable function is differentiable at z. This establishes an analog in feasible analysis of a recent result of Brattka, Miller and Nies, who characterized computable randomness in terms of differentiability of nondecreasing computable functions.
Further, we show that a Martin-Loef random real z is a density-one point if and only if each interval-c.e. function is differentiable at z. (To say z is a density-one point means that every effectively closed class containing z has density one at z. The interval-c.e. functions are, essentially, the variation functions of computable functions.)
The proofs are related: they both make use of the analytical concept of porosity in novel ways, and both use a basic geometric fact on shifting dyadic intervals by 1/3.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol025-stacs2014/LIPIcs.STACS.2014.602/LIPIcs.STACS.2014.602.pdf
Polynomial time randomness
feasible analysis
differentiability
porosity