Related papers: Finding The Sign Of A Function Value By Binary Cel…
This paper is motivated by the theory of sequential dynamical systems, developed as a basis for a mathematical theory of computer simulation. It contains a classification of finite dynamical systems on binary strings, which are obtained by…
We consider binary classification restricted to a class of continuous piecewise linear functions whose decision boundaries are (possibly nonconvex) starshaped polyhedral sets, supported on a fixed polyhedral simplicial fan. We investigate…
We present in this work a heuristic expression for the density of prime numbers. Our expression leads to results which possesses approximately the same precision of the Riemann's function in the domain that goes from 2 to 1010 at least.…
We consider the problem of computing a response curve for binary cellular automata -- that is, the curve describing the dependence of the density of ones after many iterations of the rule on the initial density of ones. We demonstrate how…
We prove that $$\int_0^1\frac{-\log f(x)}xdx=\frac{\pi^2}{3ab}$$ where $f(x)$ is the decreasing function that satisfies $f^a-f^b=x^a-x^b$, for $0<a<b$. When $a$ is an integer and $b=a+1$ we deduce several combinatorial results. These…
We study one class of continuous functions $f$ defined on segment $[0,1]$ by equality $$ f(x)=\delta_{\alpha_1(x)1}+\sum^{\infty}_{k=2}\left[\delta_{\alpha_k(x)k}\prod^{k-1}_{j=1}g_{\alpha_j…
In this paper I show that any $m$th-degree polynomial function of the elements of the density matrix $\rho$ can be determined by finding the expectation value of an observable on $m$ copies of $\rho$, without performing state tomography.…
The problem of how to compute accurately and efficiently the sign of the overlap between two general HFB wave functions is addressed. The results obtained can easily be extrapolated to the evaluation of the sign of the trace of a density…
We systematically compute the power spectra of the one-dimensional elementary cellular automata introduced by Wolfram. On the one hand our analysis reveals that one automaton displays $1/f$ spectra though considered as trivial, and on the…
Given i.i.d samples from some unknown continuous density on hyper-rectangle $[0, 1]^d$, we attempt to learn a piecewise constant function that approximates this underlying density non-parametrically. Our density estimate is defined on a…
Number-conserving cellular automata are discrete dynamical systems that simulate interacting particles like e.g. grains of sand. In an earlier paper, I had already derived a uniform construction for all transition rules of one-dimensional…
Let A be a set of integers. For every integer n, let r_{A,h}(n) denote the number of representations of n in the form n = a_1 + a_2 + ... + a_h, where a_1, a_2,...,a_h are in A and a_1 \leq a_2 \leq ... \leq a_h. The function r_{A,h}: Z \to…
Nonlinear cellular automata are extensively used in simulations, image processing, cryptography, and so on. The determination of their fundamental properties, injectivity and surjectivity, related to information loss during the evolution,…
The Ces\`aro limit - the asymptotic average of a sequence of real numbers - is an operator of fundamental importance in probability, statistics and mathematical analysis. To better understand sequences with Ces\`aro limits, this paper…
A theory of systems with long-range correlations based on the consideration of binary N-step Markov chains is developed. In our model, the conditional probability that the i-th symbol in the chain equals zero (or unity) is a linear function…
We consider several coding discretizations of continuous functions which reflect their variation at some given precision. We study certain statistical and combinatorial properties of the sequence of finite words obtained by coding a typical…
We present a method for computing probability of occurence of 1s in a configuration obtained by iteration of a probabilistic cellular automata (PCA), starting from a random initial configuration. If the PCA is sufficiently simple, one can…
Given a suitable arithmetic function h, we investigate the average order of h as it ranges over the values taken by an integral binary form F. A general upper bound is obtained for this quantity, in which the dependence upon the…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
It is speculated that there is a relationship between 1/f noise and computational universality in cellular automata. We use genetic algorithms to search for one-dimensional and two-state, five-neighbor cellular automata which have 1/f-type…