A Conjecture Equivalent to the Collatz Conjecture

08/16/2021

∙

We present a formulation of the Collatz conjecture that is potentially more amenable to modeling and analysis by automated termination checking tools.

READ FULL TEXT

A Conjecture Equivalent to the Collatz Conjecture

A Proof of the Kahn-Kalai Conjecture

An Automated Approach to the Collatz Conjecture

Approximating cube roots of integers, after Heron's Metrica III.20

Quantitative bounds for unconditional pairs of frames

Weighted exchange distance of basis pairs

A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems

Fractally-organized Connectionist Networks: Conjectures and Preliminary Results

A Conjecture Equivalent to the Collatz Conjecture

Related Research

A Proof of the Kahn-Kalai Conjecture

An Automated Approach to the Collatz Conjecture

Approximating cube roots of integers, after Heron's Metrica III.20

Quantitative bounds for unconditional pairs of frames

Weighted exchange distance of basis pairs

A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems

Fractally-organized Connectionist Networks: Conjectures and Preliminary Results