The convergence classes of Collatz function

DOI10.1016/j.tcs.2011.05.056zbMath1226.68075OpenAlexW2089218984WikidataQ56069522 ScholiaQ56069522MaRDI QIDQ719281

Livio Colussi

Publication date: 10 October 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.05.056

zbMATH Keywords

Collatz conjecture\(3n+1\) problem

Mathematics Subject Classification ID

Combinatorics on words (68R15) Recurrences (11B37) Special sequences and polynomials (11B83) Software, source code, etc. for problems pertaining to number theory (11-04)

Related Items (3)

Working in binary protects the repetends of \(1/3^{h}\): Comment on Colussi's ``The convergence classes of Collatz function ⋮ Collatz on the Dyadic Rationals in [0.5, 1) with Fractals: How Bit Strings Change Their Length Under 3x + 1 ⋮ A new approach on proving Collatz conjecture

Cites Work

• Small Turing machines and generalized busy beaver competition
• Tag systems and Collatz-like functions
• The Collatz conjecture. A case study in mathematical problem solving
• The real 3x+1 problem
• Unnamed Item
• Unnamed Item

This page was built for publication: The convergence classes of Collatz function