Edward G. Belaga
Strasbourg University
Building on theoretical insights and rich experimental data of our preprints, we present here new theoretical and experimental results in three interrelated approaches to the Collatz problem and its generalizations: algorithmic decidability, random behavior, and Diophantine representation of related discrete dynamical systems, and their cyclic and divergent properties.
Keywords 3n + 1, or Collatz problem  pseudo-rundom walks  algorithmic decidability
Categories (categorize this paper)
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Translate to english
Revision history

Download options

PhilArchive copy

 PhilArchive page | Other versions
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Algorithmic Randomness in Empirical Data.James W. McAllister - 2003 - Studies in History and Philosophy of Science Part A 34 (3):633-646.
Empirical Data Sets Are Algorithmically Compressible: Reply to McAllister.Charles Twardy, Steve Gardner & David Dowe - 2005 - Studies in the History and Philosophy of Science, Part A 36 (2):391-402.
Is Evolution Algorithmic?Marcin Miłkowski - 2009 - Minds and Machines 19 (4):465-475.
Is Abortion a Pseudo-Problem?Alister Browne - 1986 - Philosophy Research Archives 12:101-124.
On the Nature of Minds, Or: Truth and Consequences.Shimon Edelman - 2008 - Journal of Experimental and Theoretical Ai 20:181-196.


Added to PP index

Total views
174 ( #58,613 of 2,439,610 )

Recent downloads (6 months)
13 ( #51,189 of 2,439,610 )

How can I increase my downloads?


My notes