Related papers: Epsilon-complexity of continuous functions
The aim of this work is to define a continuous functional calculus in quaternionic Hilbert spaces, starting from basic issues regarding the notion of spherical spectrum of a normal operator. As properties of the spherical spectrum suggest,…
In this paper we associate with an infinite family of real extended functions defined on a locally convex space, a sum, called robust sum, which is always well-defined. We also associate with that family of functions a dual pair of problems…
We develop theory concerning non-uniform complexity in a setting in which the notion of single-pass instruction sequence considered in program algebra is the central notion. We define counterparts of the complexity classes P/poly and…
It is shown that any continuous function depending on several $p$-adic variables, each of which is defined on $\mathbb{Z}_{p}$, can be represented as a superposition of continuous functions of one $p$-adic variable. This statement is true…
The information in an individual finite object (like a binary string) is commonly measured by its Kolmogorov complexity. One can divide that information into two parts: the information accounting for the useful regularity present in the…
In the present note we prove an asymptotically tight relation between additive and multiplicative complexity of Boolean functions with respect to implementation by circuits over the basis {+,*,1}.
The Eremenko-Lyubich class consists of transcendental entire functions with bounded singular set and the Speiser class is made up of functions with a finite singular set. In an earlier paper "Models for the Eremenko-Lyubich class" I gave a…
In this article we treat a notion of continuity for a multi-valued function F and we compute the descriptive set-theoretic complexity of the set of all x for which F is continuous at x. We give conditions under which the latter set is…
We study the multifractal analysis of self-similar measures arising from random homogeneous iterated function systems. Under the assumption of the uniform strong separation condition, we see that this analysis parallels that of the…
Kolmogorov complexity theory is used to tell what the algorithmic informational content of a string is. It is defined as the length of the shortest program that describes the string. We present a programming language that can be used to…
Given a continuous real-valued function on [0, 1], and a closed subset E \subset [0, 1] we denote by f E the restriction of f to E, that is, the function defined only on E that takes the same values as f at every point of E >. The…
We provide tight upper and lower bounds on the expected minimum Kolmogorov complexity of binary classifiers that are consistent with labeled samples. The expected size is not more than complexity of the target concept plus the conditional…
In this paper, we introduce and investigate a class P of continuous and periodic functions on R. The class P is defined so that second-order central differences of a function satisfy some concavity-type estimate. Although this definition…
Nonuniform exponential dichotomy serves as an important characteristic of nonuniform hyperbolicity, while admissibility of function classes is often used to characterize nonuniform exponential dichotomy. In this paper, we investigate the…
Pseudoentropy characterizations provide a quantitatively precise demonstration of the close relationship between computational hardness and computational randomness. We prove a unified pseudoentropy characterization that generalizes and…
Steepness is a geometric property which, together with complex-analyticity, is needed in order to insure stability of a near-integrable hamiltonian system over exponentially long times. Following a strategy developed by Nekhoro-shev, we…
A problem based on the Extended Euclidean Algorithm applied to a class of polynomials with many factors is presented and believed to be hard. If so, it is a one-way function well suited for applications in digital signicatures.
Kolmogorov famously proved that multivariate continuous functions can be represented as a superposition of a small number of univariate continuous functions, $$ f(x_1,\dots,x_n) = \sum_{q=0}^{2n+1} \chi^q \left( \sum_{p=1}^n \psi^{pq}(x_p)…
We propose three kinds of explicit formulas for the elliptic lambda function by the elliptic modular function. Further, we derive incredible cubic identities as a corollary of our explicit formulas and evaluate some singular values of the…
The thesis deals with recognizing diffeomorphisms from fractal properties of discrete orbits, generated by iterations of such diffeomorphisms. The notion of fractal properties of a set refers to the box dimension, the Minkowski content and…