An algorithm to determine when certain sets have 0-density

DOI10.1016/0196-6774(81)90005-5zbMath0464.10046OpenAlexW1987625363MaRDI QIDQ3915073

David A. Klarner

Publication date: 1981

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(81)90005-5

zbMATH Keywords

computational algorithmpositive densitysets of integers

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Density, gaps, topology (11B05) Algorithms in computer science (68W99)

Related Items (3)

A sufficient condition for certain semigroups to be free ⋮ Unnamed Item ⋮ m-recognizability of sets closed under certain affine functions

This page was built for publication: An algorithm to determine when certain sets have 0-density