An Undecidable Permutation of the Natural Numbers

  • Authors:

  • Eero Lehtonen

  • Affiliations:

  • Department of Information Technology, University of Turku, Turku, Finland FI-20014

  • Venue:
  • RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, an undecidability result concerning a permutation of natural numbers is presented. More precisely, it is shown that for a certain piecewise defined permutation, which consists of five affine transformations, it is undecidable whether a given number belongs to a finite cycle or not.