In this talk I will discuss some problems involving persistence computation with a highlight on two particular cases. The first example looks at the problem of approximating relative persistent homology by extending the results on the stability of persistence modules. The second example will look at how to compute persistence with bounds on the memory usage using a spectral sequence approach. I will discuss how we encounter similar problems in both examples.