On Normality and Equidistribution for Separator Enumerators
Subin Pulari

TL;DR
This paper investigates the relationship between normality and equidistribution in the context of separator enumerators, providing counterexamples to a conjecture and establishing conditions under which equidistribution characterizes normality.
Contribution
It constructs specific separator enumerators and points to demonstrate that equidistribution alone cannot characterize $f$-normality universally, and identifies classes where it does.
Findings
Counterexamples show equidistribution does not characterize $f$-normality universally.
Finite-state coherent classes of separator enumerators admit a complete equidistribution characterization.
Beyond finite-state coherence, the characterization can fail even for efficiently computable separator enumerators.
Abstract
A separator is a countable dense subset of , and a separator enumerator is a naming scheme that assigns a real number in to each finite word so that the set of all named values is a separator. Mayordomo introduced separator enumerators to define -normality and a relativized finite-state dimension , where finite-state dimension measures the asymptotic lower rate of finite-state information needed to approximate through its -names. This framework extends classical base- normality, and Mayordomo showed that it supports a point-to-set principle for finite-state dimension. This representation-based viewpoint has since been developed further in follow-up work, including by Calvert et al., yielding strengthened randomness notions such as supernormal and highly normal numbers. Mayordomo posed the following open question: can -normality…
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 · semigroups and automata theory · Complexity and Algorithms in Graphs
