🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: sci.math.research
Article #59

decidability and dynamical systems

#59
From: Pascal Koiran
Date: Tue, 08 Sep 1992 11:10
17 lines
1193 bytes
Hello,

Can someone provide a solution to the following problem, or give references
to related work in the litterature ?

Let f:[0,1]-->[0,1] be a continuous piecewise-linear function (with a finite
number of laps). The endpoints of the laps have rational coordinates.
Given such an f and a rational x \in [0,1], is it decidable whether a fixed
point is reached in finite time when f is iterated on x ?
In other words, is it decidable whether there exists t, f^t(x)=f^{t+1}(x) ?

One can ask the same question for other classes of non-linear functions,
such as polynomials, rational functions, ...

Thanks,

Pascal.
Technical Details
Message-ID: <Bu9B1J.H8E@ens-lyon.fr>
Path: arc1-ca.pugleaf.net!sparky!uunet!usc!sdd.hp.com!ux1.cso.uiuc.edu!news.cso.uiuc.edu!usenet

Show Full Headers
Complete Article Headers
Newsgroups: sci.math.research
Path: arc1-ca.pugleaf.net!sparky!uunet!usc!sdd.hp.com!ux1.cso.uiuc.edu!news.cso.uiuc.edu!usenet
From: koiran@ens.ens-lyon.fr (Pascal Koiran)
Subject: decidability and dynamical systems
Message-ID: <Bu9B1J.H8E@ens-lyon.fr>
Sender: Daniel Grayson <dan@math.uiuc.edu>
Reply-To: koiran@ens.ens-lyon.fr
X-Submissions-To: sci-math-research@uiuc.edu
Organization: Ecole Normale Superieure de Lyon
X-Administrivia-To: sci-math-research-request@uiuc.edu
Approved: Daniel Grayson <dan@math.uiuc.edu>
Date: Tue, 8 Sep 1992 11:10:30 GMT
Lines: 20