Two undecidable variants of Collatz's problems

被引：4
|
作者：
Lehtonen, Eero [1 ]
机构：
[1] Univ Turku, Dept Math, FI-20014 Turku, Finland
来源：
THEORETICAL COMPUTER SCIENCE | 2008年 / 407卷 / 1-3期
关键词：
Collatz's conjecture; Collatz's original problem; Undecidability;
D O I：
10.1016/j.tcs.2008.08.029
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码：596 / 600
页数：5
相关论文
共 50 条
12345