Related papers: Kolmogorov structure functions for automatic compl…
We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…
We study non-autonomous conformal iterated function systems, with finite or countably infinite alphabet alike. These differ from the usual (autonomous) iterated function systems in that the contractions applied at each step in time are…
We give a method of solution to the problem of iterating holomorphic functions to fractional or complex heights. We construct an auxiliary function from natural iterates of a holomorphic function; the auxiliary function will be…
`What more than its truth do we know if we have a proof of a theorem in a given formal system?' We examine Kreisel's question in the particular context of program termination proofs, with an eye to deriving complexity bounds on program…
The paper proposes open problems in classical Kolmogorov complexity. Each problem is presented with background information and thus the article also surveys some recent studies in the area.
We describe an algorithm that, given a k-tuple of permutations representing the monodromy of a rational map, constructs an arbitrarily precise floating-point complex approximation of that map. We then explain how it has been used to study a…
Regular functions of infinite words are (partial) functions realized by deterministic two-way transducers with infinite look-ahead. Equivalently, Alur et. al. have shown that they correspond to functions realized by deterministic Muller…
It is a well-known and elementary fact that a holomorphic function on a compact complex manifold without boundary is necessarily constant. The purpose of the present article is to investigate whether, or to what extent, a similar property…
The existence of quasi-bi-Hamiltonian structures for a two-dimensional superintegrable $(k_1,k_2,k_3)$-dependent Kepler-related problem is studied. We make use of an approach that is related with the existence of some complex functions…
The even online Kolmogorov complexity of a string $x = x_1 x_2 \cdots x_{n}$ is the minimal length of a program that for all $i\le n/2$, on input $x_1x_3 \cdots x_{2i-1}$ outputs $x_{2i}$. The odd complexity is defined similarly. The sum of…
The article is devoted to one infinite parametric class of continuous functions with complicated local structure. In the article differential, integral, self-affine and other properties of functions, that their argument is represented by…
We define the topological complexity sequence of a group as the sequence of topological complexities of its Milnor constructions. This sequence may be regarded as an intrinsic refinement of the topological complexity of a group and, unlike…
To every automorphism w of an infinite rooted regular binary tree we associate a two variable generating function \Phi_w that encodes information on the orbit structure of w. We prove that this is a rational function if w can be described…
In this paper we solve Kolmogorov problem about existence of a function with given norms of derivatives for classes of multiple monotone functions and absolute monotone functions in the case of arbitrary number of norms. We also show the…
One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…
Let $Hilb ^{p(t)}(P^n)$ be the Hilbert scheme of closed subschemes of $P^n$ with Hilbert polynomial $p(t) \in Q[t]$, and let $W:= \overline{W(\underline{b};\underline{a};r)}$ be the closure of the locus in $Hilb ^{p(t)}(P^n)$ of…
Using a categorial version of Fra\"iss\'e's theorem due to Droste and G\"obel, we derive a criterion for a comma-category to have universal homogeneous objects. As a first application we give new existence result for universal structures…
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypotheses testing in a framework of classical mathematical statistics. The methods for identity testing and…
We introduce a new measure on regular languages: their nondeterministic syntactic complexity. It is the least degree of any extension of the `canonical boolean representation' of the syntactic monoid. Equivalently, it is the least number of…
By providing a procedure to apply Hrushovski's amalgamation method to the setting of classes of infinite structures, we introduce the notion of \textit{paracollapsed} structures. We show that this approach provides existentially closed…