The Undecidability Of The Generalized Collatz Problem

TAMC'07: Proceedings of the 4th international conference on Theory and applications of models of computation（2007）

引用 12|浏览7

暂无评分

摘要

The Collatz problem, widely known as the 3x + 1 problem, asks whether or not a certain simple iterative process halts on all inputs. In this paper, we build on work of J. H. Conway to show that a natural generalization of the Collatz problem is Pi(0)(2) complete.

查看译文

关键词

Collatz problem,J. H. Conway,certain simple iterative process,natural generalization,generalized Collatz problem

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要