# Finding The Sign Of A Function Value By Binary Cellular Automaton

Source: [Finding The Sign Of A Function Value By Binary Cellular Automaton](<https://www.sota2.com/research/paper/68fa25802c2a3760193b0c7a>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-24T10:45:07.282Z

Authors: H. F. Chau, H. Xu, K. M. Lee, L. W. Siu, K. K. Yan

Published: 2001-03-30T10:33:26.000Z

## Abstract

Given a continuous function $f(x)$, suppose that the sign of $f$ only has finitely many discontinuous points in the interval $\[0,1\]$. We show how to use a sequence of one dimensional deterministic binary cellular automata to determine the sign of $f(\\rho)$ where $\\rho$ is the (number) density of 1s in an arbitrarily given bit string of finite length provided that $f$ satisfies certain technical conditions.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/nlin/0103057>)

[PDF](<https://arxiv.org/pdf/nlin/0103057.pdf>)
