Numbers as Data Structures: The Prime Successor Function as Primitive
Ross D. King

TL;DR
The paper introduces prime bags, a new data structure for numbers based on prime successor functions, which improves factorization efficiency and offers novel insights into number representations and their computational properties.
Contribution
It proposes prime bags as a primitive data structure for natural numbers, enabling more efficient factorization and revealing new relationships between primes and partitions.
Findings
Prime bags enable efficient factorization of numbers.
Addition in prime bags appears computationally hard.
Reveals a novel link between prime numbers and the partition function.
Abstract
The symbolic representation of a number should be considered as a data structure, and the choice of data structure depends on the arithmetic operations that are to be performed. Numbers are almost universally represented using position based notations based on exponential powers of a base number - usually 10. This representations is computationally efficient for the standard arithmetic operations, but it is not efficient for factorisation. This has led to a common confusion that factorisation is inherently computationally hard. We propose a new representation of the natural numbers based on bags and using the prime successor function as a primitive - prime bags (PBs). This data structure is more efficient for most arithmetic operations, and enables numbers can be efficiently factored. However, it also has the interesting feature that addition appears to be computationally hard. PBs have…
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
TopicsComputability, Logic, AI Algorithms · History and Theory of Mathematics · Mathematical and Theoretical Analysis
