| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438104 | Theoretical Computer Science | 2008 | 5 Pages |
Abstract
The paper introduces a simple way to show that certain iterative, number theoretic problems are undecidable. As applications, variants of the Collatz’s conjecture and the so-called Collatz’s original problem are shown to be undecidable.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
