Professor Lange's interests are in computability theory, an area of logic that explores the algorithmic content encoded in mathematical problems. She studies the computational complexity of problems associated with algebraic structures such as real closed fields, fields that are generalizations of the real numbers, and free groups. Answering these computational questions often requires using tools from model theory, another area of logic, and algebra.