Related papers: Solovay functions and their applications in algori…
We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…
Completely multiplicative functions whose sum is zero ($CMO$).The paper deals with $CMO$, meaning completely multiplicative ($CM$) functions $f$ such that $f(1)=1$ and $\sum\limits\_1^\infty f(n)=0$. $CM$ means $f(ab)=f(a)f(b)$ for all…
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…
In this paper, we determine the complex-valued solutions of the following functional equations \[g(x\sigma (y)) = g(x)g(y)+f(x)f(y),\quad x,y\in S,\]\[f(x\sigma (y)) = f(x)g(y)+f(y)g(x),\quad x,y\in S,\]\[f(x\sigma (y)) =…
We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…
We develop an approach to Malliavin calculus for L\'evy processes from the perspective of expressing a random variable $Y$ by a functional $F$ mapping from the Skorohod space of c\`adl\`ag functions to $\mathbb{R}$, such that $Y=F(X)$ where…
We focus on (partial) functions that map input strings to a monoid such as the set of integers with addition and the set of output strings with concatenation. The notion of regularity for such functions has been defined using two-way…
A function f is continuous iff the PRE-image f^{-1}[V] of any open set V is open again. Dual to this topological property, f is called OPEN iff the IMAGE f[U] of any open set U is open again. Several classical Open Mapping Theorems in…
Algorithmic statistics has two different (and almost orthogonal) motivations. From the philosophical point of view, it tries to formalize how the statistics works and why some statistical models are better than others. After this notion of…
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…
Algorithmic statistics studies explanations of observed data that are good in the algorithmic sense: an explanation should be simple i.e. should have small Kolmogorov complexity and capture all the algorithmically discoverable regularities…
We consider the problem of inferring the probability distribution associated with a language, given data consisting of an infinite sequence of elements of the languge. We do this under two assumptions on the algorithms concerned: (i) like a…
By Kolmogorov Complexity,two number-theoretic problems are solved in different way than before,one problem is Maxim Kontsevich and Don Bernard Zagier's Problem 3 \emph{Exhibit at least one number which does not belong to} $ \mathcal{P}$…
We present a simple transformation of any linear program or semidefinite program into an equivalent convex optimization problem whose only constraints are linear equations. The objective function is defined on the whole space, making…
Given a finite alphabet $\Sigma$ and a right-infinite word $\bf w$ over $\Sigma$, we define the Lie complexity function $L_{\bf w}:\mathbb{N}\to \mathbb{N}$, whose value at $n$ is the number of conjugacy classes (under cyclic shift) of…
In this manuscript we study properties of multidimensional shifts. More precisely, we study the necessary and sufficient conditions for a shift to be sofic, i.e. the boundary between sofic shifts and effective ones. To this end, we use…
${\cal E}$ denotes the family of all finite nonempty $S\subseteq{\mathbb N}:=\{1,2,\ldots\}$, and ${\cal E}(X):={\cal E}\cap\{S:S\subseteq X\}$ when $X\subseteq{\mathbb N}$. Similarly, ${\cal F}$ denotes the family of all finite nonempty…
We propose an extension of the framework for discussing the computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represented only through approximation. The key idea…
Subtraction-free computational complexity is the version of arithmetic circuit complexity that allows only three operations: addition, multiplication, and division. We use cluster transformations to design efficient subtraction-free…
An algorithm is presented to compute Zolotarev rational functions, that is, rational functions $r_n^*$ of a given degree that are as small as possible on one set $E\subseteq\complex\cup\{\infty\}$ relative to their size on another set…