Walking Cautiously Into the Collatz Wilderness: Algorithmically, Number Theoretically, Randomly

Discrete Mathematics and Theoretical Computer Science (2006)
  Copy   BIBTEX

Abstract

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.

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Busy beaver competition and Collatz-like problems.Pascal Michel - 1993 - Archive for Mathematical Logic 32 (5):351-367.
On the nature of minds, or: Truth and consequences.Shimon Edelman - 2008 - Journal of Experimental and Theoretical Ai 20:181-196.
Decidability for ℤ[G]‐Modules when G is Cyclic of Prime Order.Carlo Toffalori - 1996 - Mathematical Logic Quarterly 42 (1):369-378.
Empirical data sets are algorithmically compressible: Reply to McAllister.Charles Twardy, Steve Gardner & David L. Dowe - 2005 - Studies in the History and Philosophy of Science, Part A 36 (2):391-402.

Analytics

Added to PP
2011-01-23

Downloads
363 (#58,565)

6 months
67 (#78,085)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Edward G. Belaga
Strasbourg University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references