Shortly after Szemeredi proved that a set of natural numbers with positive upper density contains arbitrarily long arithmetic progressions, Furstenberg gave a new proof using ergodic theory. This major event gave rise to the field of combinatorial ergodic theory, in which problems motivated by additive combinatorics are addressed with ergodic theory. In this talk we give a brief survey of some of the successes in the field, leading into a description of an interesting, yet still unproved result, which would provide a generalization of many earlier results. That is, we discuss a polynomial generalization of the IP Szemeredi Theorem: an IP, polynomial, multiple recurrence theorem. Along the way we present our own recent result (jointly with Randall McCutcheon, also of Memphis), which is a single-recurrence version of this (could be a) theorem.