We present a number of programs to investigate
and visualize chaos as it occurs
with an iterated application of functions.
We look at ways to picture orbits under repeated
application of a function (in Section 1)
and to draw final-state diagrams (in Section 3).
We discuss symbolic and numerical methods to find
periodic orbits and bifurcation points (Section 2),
as well as
super-attractive orbits
and the Feigenbaum constant (Section 5).
Further topics include statistical analysis
and visualization of
chaotic phenomena such as
sensitivity, mixing, ergodic orbits, and intermittency
(in Section 4).