Related papers: The Critical Exponent is Computable for Automatic …
It is well known that the R, the set of real numbers, is an abstract set, where almost all its elements cannot be described in any finite language. We investigate possible approaches to what might be called an epi-constructionist approach…
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data $\omega$-words). The notion of computability is defined through Turing machines with infinite inputs which can…
We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…
Propositional logics in general, considered as a set of sentences, can be undecidable even if they have "nice" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already…
A closed word (a.k.a. periodic-like word or complete first return) is a word whose longest border does not have internal occurrences, or, equivalently, whose longest repeated prefix is not right special. We investigate the structure of…
We introduce the $\Sigma_1$-definable universal finite sequence and prove that it exhibits the universal extension property amongst the countable models of set theory under end-extension. That is, (i) the sequence is $\Sigma_1$-definable…
Given the first 20-100 coefficients of a typical generating function of the type that arises in many problems of statistical mechanics or enumerative combinatorics, we show that the method of differential approximants performs surprisingly…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
An integer is said to be $y$-friable if its greatest prime factor is less than $y$. In this paper, we obtain estimates for exponential sums over $y$-friable numbers up to $x$ which are non-trivial when $y \geq \exp\{c \sqrt{\log x} \log…
We introduce the notion of a critical cardinal as the critical point of sufficiently strong elementary embedding between transitive sets. Assuming the axiom of choice this is equivalent to measurability, but it is well-known that choice is…
In the paper we study properties of the set of critical points for self-similar sets. We introduce simple condition that implies at most countably many critical values and we construct a self-similar set with uncountable set of critical…
In this note we address various algorithmic problems that arise in the computation of the operator norm in unitary representations of a group on Hilbert space. We show that the operator norm in the universal unitary representation is…
A nondeterministic automaton is semantically deterministic (SD) if different nondeterministic choices in the automaton lead to equivalent states. Semantic determinism is interesting as it is a natural relaxation of determinism, and as some…
We illustrate a general technique for enumerating factors of k-automatic sequences by proving a conjecture on the number f(n) of unbordered factors of the Thue-Morse sequence. We show that f(n) <= n for n >= 4 and that f(n) = n infinitely…
We present a calculation of critical phenomena directly in continuous dimension d employing an exact renormalization group equation for the effective average action. For an Ising-type scalar field theory we calculate the critical exponents…
We perform the computations necessary to establish a multiplicity one statement for the irreducible representations of a finite spin group which in turn yields the classification of irreducible representations of finite spin groups. (The…
We provide a numerical method to determine the critical lengths of linear differential operators with constant real coefficients. The need for such a procedure arises when the orders increase. The interest of this article is clearly on the…
A group is called capable if it is a central factor group. We consider the capability of finite groups of class two and exponent $p$, $p$ an odd prime. We restate the problem of capability as a problem about linear transformations, which…
The asymptotic critical exponent measures for a sequence the maximum repetition rate of factors of growing length. The infimum of asymptotic critical exponents of sequences of a certain class is called the asymptotic repetition threshold of…
We consider linear systems of recurrence equations whose coefficients are given in terms of indefinite nested sums and products covering, e.g., the harmonic numbers, hypergeometric products, $q$-hypergeometric products or their mixed…