Generation of Primes by a One-Dimensional Real-Time Iterative Array
From MaRDI portal
Publication:5560682
DOI10.1145/321281.321290zbMath0173.19105OpenAlexW2060249124WikidataQ57407482 ScholiaQ57407482MaRDI QIDQ5560682
Publication date: 1965
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321281.321290
Related Items (46)
Closure properties of cellular automata ⋮ Real time recognition with cellular automata : a meaningful example ⋮ One-dimensional pattern generation by cellular automata ⋮ Iterated uniform finite-state transducers on unary languages ⋮ Seven-state solutions to the firing squad synchronization problem ⋮ Real-time reversible iterative arrays ⋮ Language not recognizable in real time by one-way cellular automata ⋮ Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata ⋮ Low complexity classes of multidimensional cellular automata ⋮ Hierarchies and undecidability results for iterative arrays with sparse communication ⋮ Construction of some nonautomatic sequences by cellular automata ⋮ Column representation of Sturmian words in cellular automata ⋮ Unnamed Item ⋮ Linear speed-up for cellular automata synchronizers and applications ⋮ Inductive definitions in logic versus programs of real-time cellular automata ⋮ Fast one-way cellular automata. ⋮ Characteristic Sequences of the Sets of Sums of Squares as Columns of Cellular Automata ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Shrinking one-way cellular automata ⋮ On the Minimum Computation Time of Functions ⋮ Iterative tree arrays with logarithmic depth† ⋮ One-dimensional pattern generation by cellular automata ⋮ Iterated uniform finite-state transducers on unary languages ⋮ On real time one-way cellular array ⋮ A linear speed-up theorem for cellular automata ⋮ Languages not recognizable in real time by one-dimensional cellular automata ⋮ Hierarchies and undecidability results for iterative arrays with sparse communication ⋮ Survey of research in the theory of homogeneous structures and their applications ⋮ Bulking I: An abstract theory of bulking ⋮ Cellular automata with limited inter-cell bandwidth ⋮ Iterative arrays with direct central control ⋮ Iterative arrays with finite inter-cell communication ⋮ Iterative arrays with finite inter-cell communication ⋮ Constructible functions in cellular automata and their applications to hierarchy results ⋮ Synchronization and computing capabilities of linear asynchronous structures ⋮ Nature-Based Problems in Cellular Automata ⋮ Computations on one-dimensional cellular automata ⋮ Real-Time Prime Generators Implemented on Small-State Cellular Automata ⋮ Statistical mechanics of cellular automata ⋮ Pushdown cellular automata ⋮ Signals in one-dimensional cellular automata ⋮ Real-time language recognition by one-dimensional cellular automata ⋮ Reversible space-time simulation of cellular automata ⋮ Iterative tree automata ⋮ A universal cellular automaton in quasi-linear time and its S-m-n form ⋮ Topological transformations as a tool in the design of systolic networks
This page was built for publication: Generation of Primes by a One-Dimensional Real-Time Iterative Array
