Generation of Primes by a One-Dimensional Real-Time Iterative Array

Authors:
Patrick C. Fischer
Affiliations:
Harvard University, Cambridge, Massachusetts
Venue:
Journal of the ACM (JACM)
Year:
1965

Citing 1
Cited 54

Introduction to Mathematical Machine Theory

Introduction to Mathematical Machine Theory

Compass permits leader election

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A Survey of Microcellular Research

Journal of the ACM (JACM)
Multi-tape and infinite-state automata—a survey

Communications of the ACM
Constructible functions in cellular automata and their applications to hierarchy results

Theoretical Computer Science
On interacting automata with limited nondeterminism

Fundamenta Informaticae - Special issue on cellular automata
A design of real-time non-regular sequence generation algorithms and their implementations on cellular automata with 1-bit inter-cell communications

Fundamenta Informaticae - Special issue on cellular automata
Preface

Collision-based computing
Signals on cellular automata

Collision-based computing
Real-Time Language Recognition by One-Way and Two-Way Cellular Automata

MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Iterative Arrays with Small Time Bounds

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A Time Hierarchy for Bounded One-Way Cellular Automata

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Signals for Cellular Automata in Dimension 2 or Higher

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On Time-Constructible Functions in One-Dimensional Cellular Automata

FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Iterative Arrays with a Wee Bit Alternation

FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Fast one-way cellular automata

Theoretical Computer Science - Mathematical foundations of computer science
A unifying framework for the theory of iterative arrays of machines

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Information dynamics of cellular automata I: an algebraic study

Fundamenta Informaticae - Special issue on cellular automata
Real-time generation of primes by a 1-bit-communication cellular automaton

Fundamenta Informaticae - Special issue on cellular automata
Closure properties of cellular automata

Theoretical Computer Science
Abstract Geometrical Computation 1: Embedding Black Hole Computations with Rational Numbers

Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Low complexity classes of multidimensional cellular automata

Theoretical Computer Science
Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines

IEEE Transactions on Computers
State-Efficient One-Bit Communication Solutions for Some Classical Cellular Automata Problems
Languages not recognizable in real time by one-dimensional cellular automata

Journal of Computer and System Sciences
The on-line firing squad simulator

AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
Theory of computing in computer science education

AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem: A Geometrical Approach

Fundamenta Informaticae - Machines, Computations and Universality, Part I
Search for a solution: a case study

IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
Real-time reversible iterative arrays

Theoretical Computer Science
Real-time language recognition by one-dimensional cellular automata

Journal of Computer and System Sciences
An infinite prime sequence can be generated in real-time by a 1-bit inter-cell communication cellular automaton

DLT'02 Proceedings of the 6th international conference on Developments in language theory
A smallest five-state solution to the firing squad synchronization problem

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Incremental learning of cellular automata for parallel recognition of formal languages

DS'10 Proceedings of the 13th international conference on Discovery science
Sequence generation problem on communication-restricted cellular automata

NOLASC'06 Proceedings of the 5th WSEAS international conference on Non-linear analysis, non-linear systems and chaos
Bulking I: An abstract theory of bulking

Theoretical Computer Science
Cellular automata with limited inter-cell bandwidth

Theoretical Computer Science
Nature-based problems in cellular automata

CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Smallest implementations of optimum-time firing squad synchronization algorithms for one-bit-communication cellular automata

PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Fast iterative arrays with restricted inter-cell communication: constructions and decidability

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Cellular automata: real-time equivalence between one-dimensional neighborhoods

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
A design of symmetrical six-state 3n-step firing squad synchronization algorithms and their implementations

ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Abstract geometrical computation for black hole computation

MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Abstract geometrical computation: turing-computing ability and undecidability

CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem: A Geometrical Approach

Fundamenta Informaticae - Machines, Computations and Universality, Part I
State-Efficient One-Bit Communication Solutions for Some Classical Cellular Automata Problems

Fundamenta Informaticae - Special issue on DLT'04
Abstract Geometrical Computation 1: Embedding Black Hole Computations with Rational Numbers

Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Information Dynamics of Cellular Automata I - An Algebraic Study

Fundamenta Informaticae - Cellular Automata
Real-Time Generation of Primes by a 1-Bit-Communication Cellular Automaton

Fundamenta Informaticae - Cellular Automata
On Interacting Automata with Limited Nondeterminism

Fundamenta Informaticae - Cellular Automata
A Design of Real-Time Non-Regular Sequence Generation Algorithms and Their Implementations on Cellular Automata with 1-Bit Inter-Cell Communications

Fundamenta Informaticae - Cellular Automata
Synchronization of a Line of Identical Processors at a Given Time

Fundamenta Informaticae
Real-time reversible iterative arrays

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
A padding technique on cellular automata to transfer inclusions of complexity classes

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications

Quantified Score

Hi-index	0.03

Visualization

Abstract

A construction is given of a one-dimensional iterative of finite-state sequential machines, which can generate in real time the binary sequence representing the set of prime numbers.