English
Related papers

Related papers: Finding The Sign Of A Function Value By Binary Cel…

200 papers

The minimal number of inputs in the local function of a non-trivial cellular automaton is two. Such a function can be viewed as as a kind of binary operation. If this operation is associative, it forms, together with the set of states, a…

Cellular Automata and Lattice Gases · Physics 2026-01-05 Henryk Fukś

We consider bounded operators $A$ acting iteratively on a finite set of vectors $\{f_i : i\in I\}$ in a Hilbert space $\mathcal H$ and address the problem of providing necessary and sufficient conditions for the collection of iterates…

Functional Analysis · Mathematics 2017-11-15 C. Cabrelli , U. Molter , V. Paternostro , F. Philipp

For a symmetric bounded measurable function W on [0,1]^2, "moments" of W can be defined as values t(F,W) indexed by simple graphs. We prove that every such function is determined by its moments up to a measure preserving transformation of…

Combinatorics · Mathematics 2008-12-08 Christian Borgs , Jennifer Chayes , Laszlo Lovasz

It is shown that a set in product of $n$ metrizable spaces is the discontinuity points set of some separately continuous function if and only if this set can be represented as the union of a sequence of $F_{\sigma}$-sets which are locally…

General Topology · Mathematics 2015-12-29 V. K. Maslyuchenko , V. V. Mykhaylyuk

Recently, Land and Belew [Phys. Rev. Lett. 74, 5148 (1995)] have shown that no one-dimensional two-state cellular automaton which classifies binary strings according to their densities of 1's and 0's can be constructed. We show that a pair…

comp-gas · Physics 2009-10-30 Henryk Fuks

We study the set of strictly periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but they not spatially periodic. This set turns out to be dense for…

Formal Languages and Automata Theory · Computer Science 2012-08-15 Alberto Dennunzio , Pietro Di Lena , Luciano Margara

Feature selection is one of the most decisive tools in understanding data and machine learning models. Among other methods, sparsity induced by $L^{1}$ penalty is one of the simplest and best studied approaches to this problem. Although…

Machine Learning · Computer Science 2020-07-09 Andrii Trelin , Aleš Procházka

We know extensions of first order logic by quantifiers of the kind "there are uncountable many ...", "most ..." with new axioms and appropriate semantics. Related are operations such as "set of x, such that ...", Hilbert's…

Logic · Mathematics 2009-09-25 Josef Schoenbrunner

We introduce a novel approach to the automated termination analysis of computer programs: we use neural networks to represent ranking functions. Ranking functions map program states to values that are bounded from below and decrease as a…

Machine Learning · Computer Science 2022-09-07 Mirco Giacobbe , Daniel Kroening , Julian Parsert

It is well known that a continuously differentiable function is monotone in an interval $[a,b]$ if and only if its first derivative does not change its sign there. We prove that this is equivalent to requiring that the Caputo derivatives of…

Classical Analysis and ODEs · Mathematics 2016-05-09 Kai Diethelm

Probing the ability of automata networks to solve decision problems has received a continuous attention in the literature, and specially with the automata reaching the answer by distributed consensus, i.e., their all taking on a same state,…

Discrete Mathematics · Computer Science 2025-10-24 Eurico Ruivo , Pedro Paulo Balbi , Kévin Perrot , Marco Montalva-Medel , Eric Goles

Consider a real Gaussian stationary process $f_\rho$, indexed on either $\mathbb{R}$ or $\mathbb{Z}$ and admitting a spectral measure $\rho$. We study $\theta_{\rho}^\ell=-\lim\limits_{T\to\infty}\frac{1}{T}…

Probability · Mathematics 2025-04-04 Naomi Feldheim , Ohad Feldheim , Sumit Mukherjee

Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a…

Formal Languages and Automata Theory · Computer Science 2014-02-18 Alex Borello , Julien Cervelle , Pascal Vanier

We provide a recursive description of the signatures realizable on the standard basis by a holographic algorithm. The description allows us to prove tight bounds on the size of planar matchgates and efficiently test for standard signatures.…

Computational Complexity · Computer Science 2009-11-17 William F. Bradley

Let $\mathcal{A}(p)$ be the class consisting of functions $f$ that are holomorphic in $\ID\setminus \{p\}$, $p\in (0,1)$ possessing a simple pole at the point $z=p$ with nonzero residue and normalized by the condition $f(0)=0=f'(0)-1$. In…

Complex Variables · Mathematics 2017-05-11 Bappaditya Bhowmik , Firdoshi Parveen

Cellular automata are one-dimensional arrays of interconnected interacting finite automata. We investigate one of the weakest classes, the real-time one-way cellular automata, and impose an additional restriction on their inter-cell…

Formal Languages and Automata Theory · Computer Science 2009-07-30 Martin Kutrib , Andreas Malcher

We Propose A Novel Automaton Model which uses Arithmetic Operations as the Evolving Rules, each cell has the states of the Natural Numbers k = (N), a radius of r = 1/2 and operates on an arbitrary input size. The Automaton reads an…

Formal Languages and Automata Theory · Computer Science 2017-05-18 Abdulrhman Elnekiti

A function on a (generally infinite) graph $\G$ with values in a field $K$ of characteristic 2 will be called {\it harmonic} if its value at every vertex of $\G$ is the sum of its values over all adjacent vertices. We consider binary…

Mathematical Physics · Physics 2007-05-23 Mikhail Zaidenberg

Stationary points of multivariable function which represents some surface have an important role in many application such as computer vision, chemical physics, etc. Nevertheless, the dataset describing the surface for which a sampling…

Numerical Analysis · Computer Science 2018-09-07 Zuzana Majdisova , Vaclav Skala , Michal Smolik

A number-conserving cellular automaton is a cellular automaton whose states are integers and whose transition function keeps the sum of all cells constant throughout its evolution. It can be seen as a kind of modelization of the physical…

Discrete Mathematics · Computer Science 2008-09-03 Katsunobu Imai , Bruno Martin