TL;DR
This paper explores the creation of a cellular automaton based on prime numbers, aiming to develop axioms, theorems, and conjectures related to this novel mathematical construct.
Contribution
It introduces the concept of a prime number cellular automaton and proposes foundational axioms, theorems, and conjectures for its study.
Findings
Proposed a cellular automaton model for prime numbers
Established initial axioms and theorems for the prime automaton
Formulated conjectures to guide future research
Abstract
The basis for most of the ideas mentioned in this paper is the theory of cellular automata. A cellular automata contains a regular grid of cells, with each cell having a pre-defined set of finite states. The initial state is determined at time/state zero. At this point all the cells are assigned their respective starting states. The automata is defined by a set of simple rules that decide the subsequent states of the cells. We aim to create a cellular automata of prime numbers and come up with some axioms, theorems and conjectures for the same.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · Computability, Logic, AI Algorithms · Quasicrystal Structures and Properties