Related papers: Epsilon-complexity of continuous functions
Intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum - the set of Turing degrees of images of the relation in all computable isomorphic copies of that structure. We investigate…
We introduce a notion of $\varepsilon$-chains for continuous-time semiflows inspired by the shadow-orbit property. Although this definition differs from the $(\varepsilon,T)$-chains introduced by Conley, we prove that, for semiflows with…
A complex-analytic structure within the unit disk of the complex plane is presented. It can be used to represent and analyze a large class of real functions. It is shown that any integrable real function can be obtained by means of the…
The interaction between discrete and continuous mathematics lies at the heart of many fundamental problems in applied mathematics and computational sciences. In this paper we discuss the problem of discretizing vector-valued functions…
We define a canonical form for piecewise defined functions. We show that this has a wider range of application as well as better complexity properties than previous work.
Given a set X of finite strings, one interesting question to ask is whether there exists a member of X which is simple conditional to all other members of X. Conditional simplicity is measured by low conditional Kolmogorov complexity. We…
In resolving instances of a computational problem, if multiple instances of interest share a feature in common, it may be fruitful to compile this feature into a format that allows for more efficient resolution, even if the compilation is…
A novel topological and computational method for 'motion' is described. Motion is constrained by inequalities in terms of Kolmogorov Complexity. Causality is obtained as the output of a high-pass filter, passing through only high values of…
The theory of computational complexity focuses on functions and, hence, studies programs whose interactive behavior is reduced to a simple question/answer pattern. We propose a broader theory whose ultimate goal is expressing and analyzing…
The purpose of this thesis is to give a formal definition of quantum Kolmogorov complexity (QC), and rigorous mathematical proofs of its basic properties. The definition used here is similar to that by Berthiaume, van Dam, and Laplante. It…
We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…
The notion of Kolmogorov complexity (=the minimal length of a program that generates some object) is often useful as a kind of language that allows us to reformulate some notions and therefore provide new intuition. In this survey we…
Silverman and Stange define the notion of an aliquot cycle of length L for a fixed elliptic curve E defined over the rational numbers, and conjecture an order of magnitude for the function which counts such aliquot cycles. In the present…
We prove that every nonnegative continuous real-valued function on a given compact metric space is the uniform limit of some increasing sequence of nonnegative simple functions being linear combinations of indicators of open sets; here the…
We prove an intrinsic equivalence between strong hypercontractivity and a strong logarithmic Sobolev inequality for the cone of logarithmically subharmonic functions. We introduce a new large class of measures, Euclidean regular and…
A density function for an algebraic invariant is a measurable function on $\mathbb{R}$ which measures the invariant on an $\mathbb{R}$-scale. This function carries a lot more information related to the invariant without seeking extra data.…
Recent progress in analytical calculation of the multiple [inverse, binomial, harmonic] sums, related with epsilon-expansion of the hypergeometric function of one variable are discussed.
We survey a collective achievement of a group of researchers: the PCP Theorems. They give new definitions of the class \np, and imply that computing approximate solutions to many \np-hard problems is itself \np-hard. Techniques developed to…
We extend Matveev's complexity of 3-manifolds to PL compact manifolds of arbitrary dimension, and we study its properties. The complexity of a manifold is the minimum number of vertices in a simple spine. We study how this quantity changes…
We give exact formulae for a wide family of complexity measures that capture the organization of hidden nonlinear processes. The spectral decomposition of operator-valued functions leads to closed-form expressions involving the full…