The Scott rank was introduced in the 60's as a measure of complexity for algebraic structures. There are various other ways to measure the complexity of structures that give ordinals that are close to each other, but are not necessarily equal. We will introduce a new definition of Scott rank where all these different ways of measuring complexity always match, obtaining what the author believes is the correct definition of Scott Rank. We won't assume any background in logic, and the talk will consist mostly of an introduction to these topics.