Finding The Sign Of A Function Value By Binary Cellular Automaton
arXiv:nlin/0103057 · doi:10.1142/S0129183102003929
Abstract
Given a continuous function , suppose that the sign of only has finitely many discontinuous points in the interval . We show how to use a sequence of one dimensional deterministic binary cellular automata to determine the sign of where is the (number) density of 1s in an arbitrarily given bit string of finite length provided that satisfies certain technical conditions.
arXiv commentRevtex, uses amsfonts, 10 pages
References in corpus (6)
- Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations
- Solution of the Density Classification Problem with Two Cellular Automata Rules
- Number-conserving cellular automaton rules
- Parity Problem With A Cellular Automaton Solution
- One Dimensional ary Density Classification Using Two Cellular Automaton Rules
- Classifying Rational Densities Using Two One-Dimensional Cellular Automata