When problems defy solution, mathematicians can settle for "almost." This branch of mathematics (called computational complexity) encompasses both the number of parts involved in a problem and the intricacy of their interrelatedness. Current research in this area is discussed, considering various computer applications involved. (JN)