The automaticity of the set of primes
Abstract
The automaticity A(x) of a set X is the size of the smallest automaton that recognizes X on all words of length ≤ x. We show that the automaticity of the set of primes is at least x(-c( x)2 x), which is fairly close to the maximal automaticity.
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.