Integer complexity

Integer complexity is a way of measuring how difficult it would be to figure out the answer to a math problem. It is usually used to talk about how complex a computer program is. It measures how many steps the computer would need to take in order to solve a problem. The lower the number for the complexity, the fewer steps the computer would have to take and the easier the problem would be to solve.