Symbolic Dynamics - Dynamical Systems | Lecture 34

It is often the case that dynamical systems are difficult to analyze and so we seek a simplified representation to analyze them. Often this simplification comes in the form of symbolic dynamics wherein one translations the orbits of a system into infinite sequences of abstract symbols. In this lecture I introduce the basics of introducing these symbolic sequences through a worked example. We show that iteration through the sequence space is much easier to interpret and we can prove it is chaotic according to the definition of the previous video.
This course is taught by Jason Bramburger for Concordia University.
More information on the instructor: hybrid.concordia.ca/jbrambur/
Follow @jbramburger7 on Twitter for updates.

[@chrisli6831]

Hi Professor, I have a question about d(a,b)

[@jasonbramburger]

Equality is fine here and is included in my case. I'm not sure why I wrote

[@chrisli6831]

@@jasonbramburger Thanks for your clarification! Many thanks.

[@DanielCGCG]

Could you sum it up as, "It's *how* you say things?"
Because that hurts