Drawing the pseudo-arc

It is very likely that the pseudo-arc may occur as an attractor of some natural dynamical system. How would a picture of such a strange attractor look like? Would it be recognized as the pseudo-arc, a hereditarily indecomposable continuum? This paper shows that it could be difficult. We notice that no black and white image can look hereditarily indecomposable on any raster device (like a computer screen or a printed page). We also try to generate the best computer picture of the pseudo-arc as it is possible under the circumstances. With that purpose in mind, we expand the pseudoarc into an inverse limit with relatively simple, deterministically defined and easy to handle numerically n-crooked bonding maps. We use this expansion to assess numerical complexity of drawing the pseudo-arc with help from the Anderson-Choquet embedding theorem. We also generate graphs of ncrooked maps with large n's, and we prove that a rasterized image of such a graph does not look very crooked at all because it must contain a long straight linear vertical segment.