On a walk with a mathematician friend today we fell to talking about the value that geometric insights have had in solving difficult problems. The general thought is that great analysis is useful in solving difficult problems in well-understood systems. But geometric understanding has often been necessary to setting up the analysis properly in the first place. When I think of great physics, for example, an extraordinary ability to visualize geometry seems to run as a common thread through the best theory.
The other topic of conversation was algorithmic theory. We've been putting together algorithms for a long time -- every mathematical proof (whether true, false, or undecidable) -- is an algorithm. Algorithms are more general than equations.
So naturally we were talking about how one might go about setting up a geometry of algorithms. The connection between geometry and analysis (both real and complex) would be a subset of a more general geometry of algorithms -- viz., the subset in which real and complex functions are associated with a geometric manifold.
But let's say I wanted to start visualizing algorithms in two or three dimensions. Is there a theory for this? I remember from years ago that there are many different sorting algorithms, with quicksort being one of the fastest. Is there a systematic way to represent these algorithms in two or three dimensions and bring geometric intuition to bear on their similarities and differences?
The naive method that we talked about would involve taking a turing tape of 0s and 1s, breaking it into finite segments (of, say, 16 bits), and then mapping each segment into a two dimensional discrete grid of 256 points. An algorithm, then, would be a trajectory through that discrete space. This is unlikely to produce geometrical insights, however.
My friend insists that this is what graph theory is all about. I need to learn more graph theory. But if there are any readers that can point me towards a web page, paper, or book that provides an introduction to this type of theory, I'd be much obliged.
Recent Comments