A Chaotic Cousin Of Conway's Recursive Sequence

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

24 pages, 13 figures

Scientific paper

I study the recurrence D(n)= D(D(n-1))+D(n-1-D(n-2)), D(1)=D(2)=1. Its definition has some similarity to that of Conway's sequence defined through a(n)= a(a(n-1))+a(n-a(n-1)), a(1)=a(2)=1. However, in contradistinction to the completely regular and predictable behaviour of a(n), the D-numbers exhibit chaotic patterns. In its statistical properties, the D-sequence shows striking similarities with Hofstadter's Q(n)-sequence, defined through Q(n)= Q(n-Q(n-1))+Q(n-Q(n-2)), Q(1)=Q(2)=1. Compared to the Hofstadter sequence, the D-recurrence shows higher structural order. It is organized in well-defined ``generations'', separated by smooth and predictable regions. The article is complemented by a study of two further recurrence relations with definitions similar to those of the Q-numbers. There is some evidence that the different sequences studied share a universality class. Could it be that there are some real life processes modelled by these recurrences? I OFFER A CASH PRIZE OF $100 TO THE FIRST PROVIDING A PROOF OF SOME CONJECTURES ABOUT D(n) FORMULATED IN THIS ARTICLE.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Chaotic Cousin Of Conway's Recursive Sequence does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Chaotic Cousin Of Conway's Recursive Sequence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Chaotic Cousin Of Conway's Recursive Sequence will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-393831

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.