Related papers: The Critical Exponent is Computable for Automatic …
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
Various voting rules are based on ranking the candidates by scores induced by aggregating voter preferences. A winner (respectively, unique winner) is a candidate who receives a score not smaller than (respectively, strictly greater than)…
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages~$L$ that assign to each word~$w$ a real number~$L(w)$. In the case of infinite words, the value of a run is…
By the sometimes so-called 'Main Theorem' of Recursive Analysis, every computable real function is necessarily continuous. We wonder whether and which kinds of HYPERcomputation allow for the effective evaluation of also discontinuous…
A physical system is determined by a finite set of initial conditions and "laws" represented by equations. The system is computable if we can solve the equations in all instances using a "finite body of mathematical knowledge". In this…
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…
In this paper, we consider infinite words that arise as fixed points of primitive substitutions on a finite alphabet and finite colorings of their factors. Any such infinite word exhibits a "hierarchal structure" that will allow us to…
We establish a continuous embedding $W^{s(\cdot),2}(\Omega)\hookrightarrow L^{\alpha(\cdot)}(\Omega)$, where the variable exponent $\alpha(x)$ can be close to the critical exponent $2_{s}^*(x)=\frac{2N}{N-2\bar{s}(x)}$, with…
We establish new combinatorial transcendence criteria for continued fraction expansions. Let $\alpha = [0; a_1, a_2,...]$ be an algebraic number of degree at least three. One of our criteria implies that the sequence of partial quotients…
We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which…
Convergent infinite products, indexed by all natural numbers, in which each factor is a rational function of the index, can always be evaluated in terms of finite products of gamma functions. This goes back to Euler. A purpose of this note…
According to mathematical constructivism, a mathematical object can exist only if there is a way to compute (or "construct") it; so, what is non-computable is non-constructive. In the example of the quantum model, whose Fock states are…
As a part of our works on effective properties of probability distributions, we deal with the corresponding characteristic functions. A sequence of probability distributions is computable if and only if the corresponding sequence of…
The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable…
Cantor's diagonal method is traditionally used to prove the uncountability of the set of all infinite binary sequences. This paper analyzes the expressive limits of this method. It is shown that under any constructive application --…
Let G be a finite group and S a subset of G\{0}. We call S an additive basis of G if every element of G can be expressed as a sum over a nonempty subset in some order. Let cr(G) be the smallest integer t such that every subset of G\{0} of…
This paper studies the large-time behavior of solutions to the quasilinear inhomogeneous parabolic equation with combined nonlinearities. This equation is a natural extension of the heat equations with combined nonlinearities considered by…
An algorithm for optimizing the MERA tensor network in an infinite system is presented. Using this technique we compute the critical exponents of Ising and XXZ model.
Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…
In this paper we show that there exist two different critical exponents for global small data solutions to the semilinear fractional diffusive equation with Caputo fractional derivative in time. The second critical exponent appears if the…