Year: 2023
Type: article
Abstract: Despite decades of effort, the Collatz conjecture remains neither proved, nor refuted by a counterexample, nor formally shown to be undecidable. This note introduces the Collatz problem and probes its logical depth with a test question: can the search space for counterexamples be iteratively reduced, and when would it help?
Author: Oliver Clay
Institution: Universidad del Rosario
Language: German
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4385842759