Additive systems for Z are undecidable
Abstract
What are the collections of sets Ai⊂Z such that any n∈Z has exactly one representation as n=a0+a1+…b with ai∈Ai? The answer for N0 instead of Z is given by a theorem of de Bruijn. We describe a family of natural candidate collections for Z, which we call canonical collections. Translating the problem into the language of dynamical systems, we show that the question of whether the sumset of a canonical collection covers the entire Z is difficult: specifically, there is a collection for which this question is equivalent to the Collatz conjecture, and there is a well-behaved family of collections for which this question is equivalent to the universal halting problem for Fractran and is therefore undecidable.
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.