Poincaré's Recurrence Theorem for Two States

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

Roughly speaking, the Poincaré recurrence theorem states that, given infinite time, at some point an almost exact replica of a previous state of a system will be reached. This Demonstration has only two possible states in order to reduce computation time. You can cycle through the iterations to see the transition of elements (represented as disks) between the two states.

[more]

There is a maximum of 100,000 iterations and 15 elements to ensure that the calculations do not take more than a few seconds.

[less]

Contributed by: Ravi Sinha (August 2014)
(Mathematica Summer Camp 2014)
Open content licensed under CC BY-NC-SA


Snapshots


Details

For more information, see [1].

Reference

[1] Wikipedia. "Poincaré Recurrence Theorem." (Jul 28, 2014) en.wikipedia.org/wiki/Poincar%C3%A9_recurrence_theorem.



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send