Related papers: Online premeans and their computation complexity

We reconsider some classical natural semantics of integers (namely iterators of functions, cardinals of sets, index of equivalence relations), in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple…

Let $\alpha_1, \ldots, \alpha_m$ be two or more positive reals with sum $1$, let $C\subseteq \mathbb{R}^k$ be an open convex set, and $f: C\to \mathbb{R}^k$ be a continuous injection with convex image. For each nonempty set $S\subseteq C$,…

Let F and G be two families of meromorphic functions on a domain D, and let a, b and c be three distinct points in the extended complex plane. Let G be a normal family in D such that all limit functions of G are non-constant. If for each f…

The $k$'th frequency moment of a sequence of integers is defined as $F_k = \sum_j n_j^k$, where $n_j$ is the number of times that $j$ occurs in the sequence. Here we study the quantum complexity of approximately computing the frequency…

Given two functions $f,g:I\to\mathbf{R}$ and a probability measure $\mu$ on the Borel subsets of $[0,1]$, the two-variable mean $M_{f,g;\mu}:I^2\to I$ is defined by $$ M_{f,g;\mu}(x,y) :=\bigg(\frac{f}{g}\bigg)^{-1}\left( \frac{\int_0^1…

Inferring the means in the multivariate normal model $X \sim N_n(\theta, I)$ with unknown mean vector $\theta=(\theta_1,...,\theta_n)' \in \mathbb{R}^n$ and observed data $X=(X_1,...,X_n)'\in {\mathbb R}^n$ is a challenging task, known as…

We study the relationship between two measures of pseudorandomness for families of binary sequences: family complexity and cross-correlation measure introduced by Ahlswede et al.\ in 2003 and recently by Gyarmati et al., respectively. More…

A well-studied class of functions in communication complexity are composed functions of the form $(f \comp g^n)(x,y)=f(g(x^1, y^1),..., g(x^n,y^n))$. This is a rich family of functions which encompasses many of the important examples in the…

Floating-point addition on a finite-precision machine is not associative, so not all mathematically equivalent summations are computationally equivalent. Making this assumption can lead to numerical error in computations. Proper ordering…

We characterize continuous, symmetric and homogeneous means $M$ that can be represented in the form \begin{equation*} \frac{1}{M(x,y)}=\int_0^1 \frac{dt}{N\left(\tfrac{x+y}{2}-t\tfrac{x-y}{2},\tfrac{x+y}{2}+t\tfrac{x-y}{2}\right)}.…

We survey the emerging area of compression-based, parameter-free, similarity distance measures useful in data-mining, pattern recognition, learning and automatic semantics extraction. Given a family of distances on a set of objects, a…

In Monoidal Computer I, we introduced a categorical model of computation where the formal reasoning about computability was supported by the simple and popular diagrammatic language of string diagrams. In the present paper, we refine and…

In this work we introduce the notion of almost-symmetry for generalized numerical semigroups. In addition to the main properties occurring in this new class, we present several characterizations for its elements. In particular we show that…

Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…

Given two continuous functions $f,g:I\to\mathbb{R}$ such that $g$ is positive and $f/g$ is strictly monotone, a measurable space $(T,A)$, a measurable family of $d$-variable means $m: I^d\times T\to I$, and a probability measure $\mu$ on…

A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new ``normalized information distance'', based on the noncomputable notion of…

To solve hard problems, AI relies on a variety of disciplines such as logic, probabilistic reasoning, machine learning and mathematical programming. Although it is widely accepted that solving real-world problems requires an integration…

We show that a family ${\cal F}$ of meromorphic functions in a domain $D$ satisfying $$\frac{|f^{(k)}|}{1+|f^{(j)}|^\alpha}(z)\ge C \qquad \mbox{for all} z\in D \mbox{and all} f\in {\cal F}$$ (where $k$ and $j$ are integers with $k>j\ge 0$…

It is known that the family of power means tends to maximum pointwise if we pass argument to infinity. We will give some necessary and sufficient condition for the family of quasi-arithmetic means generated by a functions satisfying certain…

We examine the complexity of inference in Bayesian networks specified by logical languages. We consider representations that range from fragments of propositional logic to function-free first-order logic with equality; in doing so we cover…