(the application is the thurston norm in 3-manifold topology. it has a lot of information, and we know it is always a rational polytopal norm. of course, the issue is that we don't know how to compute it exactly... even bounds can be tough)
just think about R^2 at first. imagine you have an oracle to compute the norm, and you know the unit norm ball is a rational polytope a priori. can you come up with an algorithm to determine the vertices in finite time?
it's a basic fact that norms on R^n are all equivalent. but some of them are more finitary than others: suppose the unit norm ball (which specifies the norm) is a polytope with coordinates lying in Q^n (a rational polytope)
the usual definition takes as a basic concept "open sets", and says that "the preimage of an open set is open". a lot of people get confused why it isn't the other way around
i think the two most basic notions to get acclimated with is "sets are not doors" (they can be both open and closed) and the definition (or characterisation, depending on your axiomitisation) of continuity in terms of "closeness"
well, an analogous example (text: books :: actors : movies) is the general male dominance in films. you might like to read about the bechdel test, for instance