Walking Cautiously into the Collatz Wilderness : Algorithmically, Number-Theoretically, Randomly
Résumé
"We present here our results in four domains closely related to the Collatz problem and its generalizations: algorithmic decidability, Diophantine representation, cyclic structure of related discrete dynamical systems, and divergent properties of such systems. This article has been published in the ""Fourth Colloquium on Mathematics and Computer Science : Algorithms, Trees, Combinatorics ans Probabilities"" .- September 18-22, 2006 ; Institut Elie Cartan, Nancy, France"
Origine : Fichiers produits par l'(les) auteur(s)
Loading...