Finding The Sign Of A Function Value By Binary Cellular Automaton
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() where is the (number) density of 1s in an arbitrarily given bit string of finite length provided that f satisfies certain technical conditions.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.