There is a study of complexity in math that rates the difficulty of certain problem. Some problems are polynomial time, which is another way of saying "not too hard" and there are problems called NP complete, which are very-very hard! And both, packing laguage and folding up an origami crease patern, are NP complete problems; very-very hard!
Πηγή: Robert Lang folds way-new origami (TED ideas worth spreading)
Wired Science: Origami Master